On the chromatic index of almost all graphs
From MaRDI portal
Publication:1246431
DOI10.1016/0095-8956(77)90039-9zbMath0378.05032WikidataQ55966565 ScholiaQ55966565MaRDI QIDQ1246431
Publication date: 1977
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(77)90039-9
05C15: Coloring of graphs and hypergraphs
Related Items
Graph theory (algorithmic, algebraic, and metric problems), The chromatic index of multigraphs that are nearly full, Edge-colouring random graphs, Degree sequences of random graphs, Lower bounds on the cover-index of a graph, On induced subgraphs with odd degrees, On the chromatic forcing number of a random graph, Unnamed Item
Cites Work