Spanning triangulations in graphs

DOI10.1002/jgt.20076zbMath1066.05057OpenAlexW4246353243MaRDI QIDQ5462389

Deryk Osthus, Daniela Kühn

Publication date: 1 August 2005

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

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

zbMATH Keywords

planar graphsregularity lemmaextremal graph theory

Mathematics Subject Classification ID

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

Related Items (9)

Spanning surfaces in \(3\)-graphs ⋮ Maximum planar subgraphs in dense graphs ⋮ On Degree Sequences Forcing The Square of a Hamilton Cycle ⋮ Spanning 3-colourable subgraphs of small bandwidth in dense graphs ⋮ Proof of the bandwidth conjecture of Bollobás and Komlós ⋮ Properties of \(\pi\)-skew graphs with applications ⋮ Spanning embeddings of arrangeable graphs with sublinear bandwidth ⋮ Large planar subgraphs in dense graphs ⋮ An Extension of the Blow-up Lemma to Arrangeable Graphs

Cites Work

• Large planar subgraphs in dense graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Spanning triangulations in graphs