On the chromatic forcing number of a random graph

DOI10.1016/0166-218X(83)90022-7zbMATH Open0508.05055MaRDI QIDQ1837705FDOQ1837705

Authors: Colin 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)

Cites Work

• Graph theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fast probabilistic algorithms for Hamiltonian circuits and matchings
• Advances in graph theory
• Title not available (Why is that?)
• On colouring random graphs
• Title not available (Why is that?)
• On the chromatic index of almost all graphs
• Title not available (Why is that?)
• The tail of the hypergeometric distribution
• Vertices of given degree in a random graph
• Achromatic numbers of random graphs
• Determining the Chromatic Number of a Graph
• An Algorithm for Determining the Chromatic Number of a Graph
• Title not available (Why is that?)

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)