A Characterization of Graphs with Fractional Total Chromatic Number Equal to

DOI10.1016/j.endm.2009.11.039zbMath1268.05075OpenAlexW2043966931MaRDI QIDQ2840543

Takehiro Ito, W. Sean Kennedy, Bruce A. Reed

Publication date: 19 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2009.11.039

zbMATH Keywords

graph theoryedge colouringfractional total chromatic numberfractional total colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Graph coloring approach with new upper bounds for the chromatic number: team building application ⋮ Fractional total colourings of graphs of high girth

Cites Work

• Unnamed Item
• Unnamed Item
• Asymptotics of the chromatic index for multigraphs
• Fractionally colouring total graphs
• Odd Minimum Cut-Sets and b-Matchings
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
• On the hardness of approximating minimization problems
• Free Bits, PCPs, and Nonapproximability---Towards Tight Results
• Maximum matching and a polyhedron with 0,1-vertices

This page was built for publication: A Characterization of Graphs with Fractional Total Chromatic Number Equal to