Lower bounds on the cover-index of a graph

DOI10.1016/0012-365X(79)90076-1zbMath0403.05039OpenAlexW1981825245MaRDI QIDQ1255966

Lars Døvling Andersen

Publication date: 1979

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

Full work available at URL: https://doi.org/10.1016/0012-365x(79)90076-1

zbMATH Keywords

Lower BoundsFinite GraphColouringCover-IndexCover-Index of a Graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

The cover-index of infinite graphs ⋮ On Gupta’s Codensity Conjecture ⋮ A sufficient condition for equitable edge-colourings of simple graphs

Cites Work

• Méthode et théorème général de coloration des aretes d'un multigraphe
• On the chromatic index of almost all graphs
• On the edge-chromatic number of a graph
• On decompositions of a multi-graph into spanning subgraphs
• On edge-colorings of graphs.
• Blocking and anti-blocking pairs of polyhedra
• A Theorem on Coloring the Lines of a Network
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Lower bounds on the cover-index of a graph