Another characterisation of planar graphs
The electronic journal of combinatorics, Tome 17 (2010)
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.
@article{10_37236_464,
author = {C. H. C. Little and G. Sanjith},
title = {Another characterisation of planar graphs},
journal = {The electronic journal of combinatorics},
year = {2010},
volume = {17},
doi = {10.37236/464},
zbl = {1184.05030},
url = {http://geodesic.mathdoc.fr/articles/10.37236/464/}
}
C. H. C. Little; G. Sanjith. Another characterisation of planar graphs. The electronic journal of combinatorics, Tome 17 (2010). doi: 10.37236/464
Cité par Sources :