A separation property of planar triangulations

DOI10.1002/JGT.3190110108zbMATH Open0612.05055OpenAlexW1981969858MaRDI QIDQ3752423FDOQ3752423

Authors: Reinhard Diestel 

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.3190110108

Recommendations

• scientific article; zbMATH DE number 57414
• Hamilton cycles in plane triangulations
• A generalization of chordal graphs
• Separating 3-cycles in plane triangulations
• scientific article; zbMATH DE number 1979709

zbMATH Keywords

chordal graphsplanar triangulationssimplicial decompositionsinduced separating cycle

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Paths and cycles (05C38) Graph theory (05C99)

Cites Work

• On the representation of triangulation graphs in trees

Cited In (10)

• Separating trilaterals in a family of plane graphs
• Properties of triangulations obtained by the longest-edge bisection
• A theorem on polyhedra which is related to Alexander's separation theorem
• Simplicial decompositions of graphs - some uniqueness results
• Separability by two lines and by nearly straight polygonal chains
• A generalization of chordal graphs
• Simplicial decompositions of graphs: A survey of applications
• New characterizations of Gallai's \(i\)-triangulated graphs
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: A separation property of planar triangulations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3752423)