On the chromatic forcing number of a random graph

DOI10.1016/0166-218X(83)90022-7zbMath0508.05055MaRDI QIDQ1837705

Colin J. H. McDiarmid

Publication date: 1983

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

zbMATH Keywords

chromatic indexchromatic forcing numberlargest complete subgraph

Mathematics Subject Classification ID

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

Related Items

The chromatic number of random graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast probabilistic algorithms for Hamiltonian circuits and matchings
• Advances in graph theory
• On the chromatic index of almost all graphs
• The tail of the hypergeometric distribution
• Achromatic numbers of random graphs
• Vertices of given degree in a random graph
• On colouring random graphs
• Determining the Chromatic Number of a Graph
• An Algorithm for Determining the Chromatic Number of a Graph