Another characterisation of planar graphs
From MaRDI portal
Summary: A new characterisation of planar graphs is presented. It concerns the structure of the cocycle space of a graph, and is motivated by consideration of the dual of an elementary property enjoyed by sets of circuits in any graph.
Recommendations
Cited in
(15)- A characterization of level planar graphs
- On Boolean characterizations of planarity and planar embeddings of graphs
- A circuit characterization of graphic matroids
- A structural property of planar graphs
- Another two graphs with no planar covers
- scientific article; zbMATH DE number 431506 (Why is no real title available?)
- Discrete characterizations of planarity part I: the classical viewpoint
- A planarity criterion for graphs
- scientific article; zbMATH DE number 4010536 (Why is no real title available?)
- Walks through every edge exactly twice
- An algebraic characterization of planar graphs
- Characterizing planarity using theta graphs
- Characterizations of planar plick graphs
- On the Characterization of Plane Bus Graphs
- Exact algorithms for the maximum planar subgraph problem: new models and experiments
This page was built for publication: Another characterisation of planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2380426)