A characterization of graphs with fractional total chromatic number equal to +2

DOI10.1016/J.ENDM.2009.11.039MaRDI QIDQ2840543zbMATH OpenOpenAlexFDO

Authors Takehiro Ito, W. Sean Kennedy, Bruce 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

edge colouringfractional total chromatic numberfractional total colouringgraph theory

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Fractionally colouring total graphs
• scientific article; zbMATH DE number 742644
• On total colourings of graphs
• Some results on fractional edge coloring of graphs.
• Fractionally total colouring \(G_{n,p}\)

Cites work

• Asymptotics of the chromatic index for multigraphs
• Fractionally colouring total graphs
• Free Bits, PCPs, and Nonapproximability---Towards Tight Results
• scientific article; zbMATH DE number 1234104 (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
• 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

Cited in

(5)

• Fractionally colouring total graphs
• Fractionally total colouring \(G_{n,p}\)
• Some results on fractional edge coloring of graphs.
• Graph coloring approach with new upper bounds for the chromatic number: team building application
• Fractional total colourings of graphs of high girth

This page was built for publication: A characterization of graphs with fractional total chromatic number equal to \(\Delta +2\)

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