On the chromatic forcing number of a random graph

DOI10.1016/0166-218X(83)90022-7MaRDI QIDQ1837705zbMATH OpenFDO

Authors Colin McDiarmid

Publication date 1983

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

Full work available at URL https://doi.org/10.1016/0166-218X(83)90022-7

zbMATH Keywords

chromatic forcing numberchromatic indexlargest complete subgraph

Mathematics Subject Classification ID

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

Cites work

• Achromatic numbers of random graphs
• Advances in graph theory
• An Algorithm for Determining the Chromatic Number of a Graph
• Determining the Chromatic Number of a Graph
• Fast probabilistic algorithms for Hamiltonian circuits and matchings
• Graph theory
• scientific article; zbMATH DE number 4134071 (Why is no real title available?)
• scientific article; zbMATH DE number 3654142 (Why is no real title available?)
• scientific article; zbMATH DE number 3689411 (Why is no real title available?)
• scientific article; zbMATH DE number 3482343 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3273761 (Why is no real title available?)
• On colouring random graphs
• On the chromatic index of almost all graphs
• The tail of the hypergeometric distribution
• Vertices of given degree in a random graph

Cited in

(1)

• The chromatic number of random graphs

This page was built for publication: On the chromatic forcing number of a random graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1837705)