Fractionally colouring total graphs

DOI10.1007/BF01303515zbMath0795.05056WikidataQ56390752 ScholiaQ56390752MaRDI QIDQ1316649

K. Kilakos, Bruce A. Reed

Publication date: 29 August 1994

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

stable setcolouringsimple graphtotal graph

Mathematics Subject Classification ID

Integer programming (90C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (9)

Fractional total colourings of graphs of high girth ⋮ Minimum total coloring of planar graph ⋮ Fractionally total colouring \(G_{n,p}\) ⋮ On topological relaxations of chromatic conjectures ⋮ Total and fractional total colourings of circulant graphs ⋮ Generalized fractional total colorings of graphs ⋮ Generalized fractional and circular total colorings of graphs ⋮ A Characterization of Graphs with Fractional Total Chromatic Number Equal to ⋮ \((\mathcal{P},\mathcal{Q})\)-total \((r,s)\)-colorings of graphs

Cites Work

• Fractional total colouring
• An upper bound for the total chromatic number
• Anti-blocking polyhedra
• Maximum matching and a polyhedron with 0,1-vertices
• On Total Chromatic Number of a Graph

This page was built for publication: Fractionally colouring total graphs