Fractional total colourings of graphs of high girth
From MaRDI portal
Publication:651031
DOI10.1016/j.jctb.2010.12.005zbMath1234.05091DBLPjournals/jct/KaiserKK11arXiv0911.2808OpenAlexW2165425588WikidataQ57601394 ScholiaQ57601394MaRDI QIDQ651031
Daniel Král', Tomáš Kaiser, Andrew D. King
Publication date: 8 December 2011
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0911.2808
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constructions for cubic graphs with large girth
- A bound on the total chromatic number
- Fractionally colouring total graphs
- A Characterization of Graphs with Fractional Total Chromatic Number Equal to
- An improved bound for the strong chromatic number
- The strong chromatic number of a graph
- On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
- On the Strong Chromatic Number
- Transversals of Vertex Partitions in Graphs
- The Last Fraction of a Fractional Conjecture
- Maximum matching and a polyhedron with 0,1-vertices
This page was built for publication: Fractional total colourings of graphs of high girth
