Fractional total colourings of graphs of high girth

DOI10.1016/J.JCTB.2010.12.005MaRDI QIDQ651031zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Tomáš Kaiser, Daniel Král', 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

zbMATH Keywords

fractional total chromatic numbertotal colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Abstract: Reed conjectured that for every epsilon>0 and Delta there exists g such that the fractional total chromatic number of a graph with maximum degree Delta and girth at least g is at most Delta+1+epsilon. We prove the conjecture for Delta=3 and for even Delta>=4 in the following stronger form: For each of these values of Delta, there exists g such that the fractional total chromatic number of any graph with maximum degree Delta and girth at least g is equal to Delta+1.

Recommendations

• The last fraction of a fractional conjecture
• Total colourings of planar graphs with large girth
• The Total Chromatic Number of Graphs of High Minimum Degree
• Fractional total colouring
• The total chromatic number of graphs having large maximum degree

Cites work

• A bound on the total chromatic number
• A characterization of graphs with fractional total chromatic number equal to \(\Delta +2\)
• An improved bound for the strong chromatic number
• Constructions for cubic graphs with large girth
• Fractionally colouring total graphs
• scientific article; zbMATH DE number 46153 (Why is no real title available?)
• scientific article; zbMATH DE number 1131873 (Why is no real title available?)
• scientific article; zbMATH DE number 5174567 (Why is no real title available?)
• scientific article; zbMATH DE number 2203240 (Why is no real title available?)
• scientific article; zbMATH DE number 3284071 (Why is no real title available?)
• Maximum matching and a polyhedron with 0,1-vertices
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
• On the Strong Chromatic Number
• The last fraction of a fractional conjecture
• The strong chromatic number of a graph
• Transversals of Vertex Partitions in Graphs

Cited in

(10)

• Generalized fractional total colorings of graphs
• On the total coloring of generalized Petersen graphs
• Fractional colorings of cubic graphs with large girth
• Girth and fractional chromatic number of planar graphs
• The Glauber Dynamics on Colorings of a Graph with High Girth and Maximum Degree
• Fractional DP-chromatic number of planar graphs of large girth
• On thef-matching polytope and the fractionalf-chromatic index
• The last fraction of a fractional conjecture
• Fractional coloring with local demands and applications to degree-sequence bounds on the independence number
• Total and fractional total colourings of circulant graphs

This page was built for publication: Fractional total colourings of graphs of high girth

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q651031)