Fractionally total colouring \(G_{n,p}\)

DOI10.1016/j.dam.2007.05.052zbMath1143.05030OpenAlexW1990401792MaRDI QIDQ2482106

Conor Meagher, Bruce A. Reed

Publication date: 16 April 2008

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2007.05.052

zbMATH Keywords

random graphsgraph colouringfractional total colouring

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A total-chromatic number analogue of Plantholt's theorem
• The ellipsoid method and its consequences in combinatorial optimization
• On the ratio of optimal integral and fractional covers
• Zero knowledge and the chromatic number
• Fractionally colouring total graphs
• König-Egerváry graphs, 2-bicritical graphs and fractional matchings
• On total colourings of graphs
• Edge Dominating Sets in Graphs
• Odd Minimum Cut-Sets and b-Matchings
• On the hardness of approximating minimization problems
• Paths in graphs
• Integer Programming: Methods, Uses, Computations
• Paths, Trees, and Flowers