DETERMINING CROSSING NUMBERS OF GRAPHS OF ORDER SIX USING CYCLIC PERMUTATIONS

DOI10.1017/S000497271800059XzbMath1402.05050OpenAlexW2886035401WikidataQ129369647 ScholiaQ129369647MaRDI QIDQ4559259

Michal Staš

Publication date: 3 December 2018

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s000497271800059x

zbMATH Keywords

graphrotationdrawingcrossing numberjoin product

Mathematics Subject Classification ID

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

Related Items (4)

On the crossing numbers of join products of five graphs of order six with the discrete graph ⋮ ON THE CROSSING NUMBER OF THE JOIN OF THE WHEEL ON FIVE VERTICES WITH THE DISCRETE GRAPH ⋮ Determining crossing number of join of the discrete graph with two symmetric graphs of order five ⋮ A survey of graphs with known or bounded crossing numbers

Cites Work

• The optimal drawings of \(K_{5,n}\)
• On the crossing numbers of Cartesian products of wheels and trees
• The crossing numbers of join of the special graph on six vertices with path and cycle
• The crossing numbers of join products of paths with graphs of order four
• The Join of Graphs and Crossing Numbers
• Cyclic‐order graphs and Zarankiewicz's crossing‐number conjecture
• The crossing number of K5,n
• Unnamed Item

This page was built for publication: DETERMINING CROSSING NUMBERS OF GRAPHS OF ORDER SIX USING CYCLIC PERMUTATIONS