On the Thickness of Sparse Random Graphs

DOI10.1017/S0963548300000353zbMath0793.05107OpenAlexW5270008MaRDI QIDQ4291190

Colin Cooper

Publication date: 5 May 1994

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548300000353

zbMATH Keywords

thicknessarboricitysparse random graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Related Items (1)

A simulated annealing algorithm for determining the thickness of a graph

Cites Work

• Edge disjoint spanning trees in random graphs
• Almost all graphs with 1.44n edges are 3-colorable
• On tree census and the giant component in sparse random graphs
• Decomposition of Finite Graphs Into Forests

This page was built for publication: On the Thickness of Sparse Random Graphs