On the chromatic forcing number of a random graph
From MaRDI portal
Publication:1837705
DOI10.1016/0166-218X(83)90022-7zbMath0508.05055MaRDI QIDQ1837705
Publication date: 1983
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Related Items
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