Skip to main content
SpringerLink
Log in

Choosability of Powers of Circuits

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract.

 It is proved that ch(G)=χ(G) if G=C n p, the pth power of the circuit graph C n , or if G is a uniform inflation of such a graph. The proof uses the method of Alon and Tarsi. As a corollary, the (a : b)-choosability conjectures hold for all such graphs.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. School of Mathematical Sciences, University of Nottingham, Nottingham, NG7 2RD, UK., , , , , , GB

    Anton Prowse

  2. School of Mathematical Sciences, University of Nottingham, Nottingham, NG7 2RD, UK. e-mail: douglas.woodall@nottingham.ac.uk, , , , , , GB

    Douglas R. Woodall

Authors
  1. Anton Prowse
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Douglas R. Woodall
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received: October 10, 2000 Final version received: November 8, 2001

Rights and permissions

Reprints and permissions

About this article

Cite this article

Prowse, A., Woodall, D. Choosability of Powers of Circuits. Graphs and Combinatorics 19, 137–144 (2003). https://doi.org/10.1007/s00373-002-0486-8

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-002-0486-8

Search

Navigation