Premium
On 3‐regular graphs having crossing number at least 2
Author(s) -
McQuillan Dan,
Richter R. Bruce
Publication year - 1994
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190180807
Subject(s) - crossing number (knot theory) , mathematics , combinatorics , graph , planar graph , discrete mathematics , engineering , intersection (aeronautics) , aerospace engineering
We give a planar proof of the fact that if G is a 3‐regular graph minimal with respect to having crossing number at least 2, then the crossing number of G is 2.