The maximum interval number of graphs with given genus

DOI10.1002/jgt.3190110317zbMath0652.05026OpenAlexW2047084444MaRDI QIDQ3797204

Edward R. Scheinerman

Publication date: 1987

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190110317

zbMATH Keywords

intersection graphinterval numbergraphs with higher genusmaximum arboricity

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (6)

On the interval number of special graphs ⋮ On the thickness and arboricity of a graph ⋮ Interval numbers of powers of block graphs ⋮ Representations of graphs and networks (coding, layouts and embeddings) ⋮ Approximating \(k\)-spanner problems for \(k>2\) ⋮ Reverse binary graphs

Cites Work

• Lehmans switching game and a theorem of Tutte and Nash-Williams

This page was built for publication: The maximum interval number of graphs with given genus