On the crossing numbers of G C_n for graphs G on six vertices

DOI10.7151/DMGT.1542MaRDI QIDQ3089350zbMATH OpenOpenAlexFDO

Authors Emília Draženská, Marián Klešč

Publication date 24 August 2011

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7151/dmgt.1542

zbMATH Keywords

graphcycleCartesian productcrossing numberdrawing

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• The crossing number of \(G \mathbin{\square} C_n\) for the graph \(G\) on six vertices
• The crossing numbers of products of path with graphs of order six
• On the crossing numbers of Cartesian products of paths with special graphs
• On the crossing numbers of Cartesian products of stars and graphs of order six
• On the crossing number of the Cartesian product of a 6-vertex graph with \(S_n\)

Cited in

(15)

• The crossing numbers of a 6-vertex graph \(G\) and products \(S_n\)
• A survey of graphs with known or bounded crossing numbers
• On the crossing numbers of Cartesian products of small graphs with paths, cycles and stars
• The crossing numbers of products of path with graphs of order six
• scientific article; zbMATH DE number 1156593 (Why is no real title available?)
• The crossing numbers of products of cycles with \(6\)-vertex trees
• Some crossing numbers of products of cycles
• The crossing numbers of products of paths with 7-vertex trees
• The crossing numbers of products of 5-vertex graphs with cycles
• DETERMINING CROSSING NUMBERS OF GRAPHS OF ORDER SIX USING CYCLIC PERMUTATIONS
• The crossing number of \(G \mathbin{\square} C_n\) for the graph \(G\) on six vertices
• On the crossing numbers of Cartesian products of stars and graphs of order six
• The crossing number of \(C_6\times C_n\)
• On the crossing numbers of Cartesian products of paths with special graphs
• The crossing number of the hexagonal graph \(H_{3,n}\)

This page was built for publication: On the crossing numbers of \(G\square C_n\) for graphs \(G\) on six vertices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3089350)