Skip to main content

Part of the book series: CRM Series ((CRMSNS,volume 16))

Abstract

We introduce a new framework designed for constructing graphs with given circular chromatic index. This framework allows construction of graphs with arbitrary maximum degree and with additional properties, e.g. high connectivity or large girth. We utilize this framework to construct a cyclically 4-edge-connected cubic graph with girth 5 and circular chromatic index r for any rational r ∈ (3, 3 + 1/4.5).

The authors acknowledge partial support from the research grant APW-0223-10 and from the APW grant ESF-EC-0009-10 within the EUROCORES Programme EUROGIGA (project GRe-GAS) of the European Science Foundation. The second author also acknowledges partial support from the Trnava University grant 8/TU/13.

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

Access this chapter

eBook
USD 24.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 34.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. P. Afshani, M. Ghandehari, M. Ghandehari, H. Hatami, R. Tusserkani and X. Zhu, Circular chromatic index of graphs of maximum degree 3, J. Graph Theory 49 (2005), 325–335.

    Article  MATH  MathSciNet  Google Scholar 

  2. M. Ghebleh, Circular chromatic index of generalized Blanusa snarks, Electron. J. Combin. 15 (2008).

    Google Scholar 

  3. D. Král’, E. Máčajová, J. Mazák and J.-S. Sereni, Circular edge-colourings of cubic graphs with girth six, J. Combin. Theory Ser.B 100 (2010), 351–358.

    Article  MATH  MathSciNet  Google Scholar 

  4. R. Lukot’ka and J. Mazák, Cubic graphs with given circular chromatic index, SIAM J. Discrete Math. 24(3) (2011), 1091–1103.

    Article  Google Scholar 

  5. J. Mazák, Circular chromatic index of type 1 Blanuša snarks, J. Graph Theory 59 (2008), 89–96.

    Article  MATH  MathSciNet  Google Scholar 

  6. R. Nedela and M. Škoviera, Decompositions and reductions of snarks, J. Graph Theory 22 (1996), 253–279.

    Article  MATH  MathSciNet  Google Scholar 

  7. X. Zhu, Circular chromatic number: a survey, Discrete Math. 29 (2001) 371–410.

    Article  Google Scholar 

  8. X. Zhu, Recent developments in circular colourings of graphs, In: “Topics in Discrete Mathematics”, Springer, 2006, 497–550.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Jaroslav Nešetřil Marco Pellegrini

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Scuola Normale Superiore Pisa

About this paper

Cite this paper

Lukot’ka, R., Mazák, J. (2013). Non-trivial snarks with given circular chromatic index. In: Nešetřil, J., Pellegrini, M. (eds) The Seventh European Conference on Combinatorics, Graph Theory and Applications. CRM Series, vol 16. Edizioni della Normale, Pisa. https://doi.org/10.1007/978-88-7642-475-5_11

Download citation

Publish with us

Policies and ethics