Author:
Little C. H. C.,Sanjith G.
Abstract
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.
Publisher
The Electronic Journal of Combinatorics
Subject
Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science,Applied Mathematics,Discrete Mathematics and Combinatorics
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Exact Algorithms for the Maximum Planar Subgraph Problem;ACM Journal of Experimental Algorithmics;2019-12-17
2. A circuit characterization of graphic matroids;Journal of Combinatorial Theory, Series B;2016-05
3. A Planarity Criterion for Graphs;SIAM Journal on Discrete Mathematics;2015-01