A note on the parity of the number of crossings of a graph
From MaRDI portal
Publication:1235708
DOI10.1016/0095-8956(76)90032-0zbMath0352.05025OpenAlexW1977554488MaRDI QIDQ1235708
Publication date: 1976
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(76)90032-0
Related Items (16)
Bad drawings of small complete graphs ⋮ On the Crossing Number of Kn without Computer Assistance ⋮ The \(\mathbb{Z}_2\)-genus of Kuratowski minors ⋮ Convex drawings of the complete graph: topology meets geometry ⋮ The crossing number of \(K_{5,n+1} \setminus e\) ⋮ Removing even crossings ⋮ Simple realizability of complete abstract topological graphs simplified ⋮ Removing Even Crossings on Surfaces ⋮ A New Approach to Exact Crossing Minimization ⋮ Pfaffian graphs, \(T\)-joins and crossing numbers ⋮ Unnamed Item ⋮ The $\mathbb{Z}_2$-genus of Kuratowski minors ⋮ Hanani-Tutte and Monotone Drawings ⋮ Removing even crossings on surfaces ⋮ Coloring graphs with crossings ⋮ Subthrackleable graphs and four-cycles
Cites Work
This page was built for publication: A note on the parity of the number of crossings of a graph
