On the chromatic index of almost all graphs

DOI10.1016/0095-8956(77)90039-9zbMath0378.05032OpenAlexW2150522168WikidataQ55966565 ScholiaQ55966565MaRDI QIDQ1246431

Robin J. Wilson, Paul Erdős

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

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (29)

Abelian factors in 2-step nilpotent Lie algebras constructed from graphs ⋮ On induced subgraphs with odd degrees ⋮ Edge (m,k)-choosability of graphs ⋮ The tournament scheduling problem with absences ⋮ Edge-colouring random graphs ⋮ The degree distribution of the random multigraphs ⋮ Colorful polytopes and graphs ⋮ Concentration of maximum degree in random planar graphs ⋮ Edge-colouring graphs with bounded local degree sums ⋮ Direct computation of scattering matrices for general quantum graphs ⋮ Degree sequences of random graphs ⋮ Unnamed Item ⋮ The chromatic index of multigraphs that are nearly full ⋮ Graphs whose edge set can be partitioned into maximum matchings ⋮ On edge colorings of 1-planar graphs without 5-cycles with two chords ⋮ Minimum edge cuts in diameter 2 graphs ⋮ Identifying stable network structures and sets of key players using a \(W\)-covering perspective ⋮ Random perfect graphs ⋮ Facial rainbow edge-coloring of simple 3-connected plane graphs ⋮ Graph edge coloring: a survey ⋮ The maximum and minimum degree of the random \(r\)-uniform \(r\)-partite hypergraphs ⋮ New potential functions for greedy independence and coloring ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ Lower bounds on the cover-index of a graph ⋮ Edge-colouring of graphs and hereditary graph properties ⋮ Goldberg's conjecture is true for random multigraphs ⋮ The Hilton--Zhao Conjecture is True for Graphs with Maximum Degree 4 ⋮ On the chromatic forcing number of a random graph ⋮ A brief history of edge-colorings – with personal reminiscences

Cites Work

• On the edge-chromatic number of a graph
• Multicoloring the incidentors of a weighted directed multigraph
• Almost all Graphs have a Spanning Cycle
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the chromatic index of almost all graphs