On the crossing numbers of Cartesian products of wheels and trees

DOI10.7151/DMGT.1957zbMATH Open1359.05103OpenAlexW2583539467MaRDI QIDQ521759FDOQ521759

Authors: Marián Klešč, Jana Petrillová, Matúš Valo 

Publication date: 12 April 2017

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

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

Recommendations

• The crossing number of Cartesian product of 5-wheel with any tree
• On the crossing numbers of Cartesian products with trees
• The crossing numbers of Cartesian products of path with some graphs.
• scientific article; zbMATH DE number 5732461
• Zip product of graphs and crossing numbers

zbMATH Keywords

Cartesian productgraph drawingcrossing numberjoin product

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Paths and cycles (05C38) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• The crossing number of \(K_{1,4,n}\)
• The crossing number of K5,n
• The crossing number ofCm �Cn is as conjectured forn ?m(m + 1)
• On the crossing numbers of products of cycles and graphs of order four
• The crossing numbers of products of paths and stars with 4‐vertex graphs
• The crossing number of \(P^2_n \square C_3\)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the crossing numbers of Cartesian products with paths
• The crossing numbers of join of the special graph on six vertices with path and cycle
• A New Approach to Exact Crossing Minimization
• The crossing numbers of join products of paths with graphs of order four
• The Join of Graphs and Crossing Numbers
• The crossing number ofK1,3,n andK2,3,n
• The crossing number of the Cartesian product of paths with complete graphs
• On the parity of crossing numbers
• An ILP-based Proof System for the Crossing Number Problem
• Experiments on exact crossing minimization using column generation
• On the crossing numbers of Cartesian products with trees
• Title not available (Why is that?)
• The crossing numbers of Cartesian products of paths with 5-vertex graphs
• On the crossing numbers of \(K_m\square C_n\) and \(K_{m,l}\square P_n\)
• A branch-and-cut approach to the crossing number problem

Cited In (16)

• The crossing numbers of join products of four graphs of order five with paths and cycles
• The crossing number of Cartesian product of 5-wheel with any tree
• Determining crossing number of join of the discrete graph with two symmetric graphs of order five
• The crossing numbers of join of special disconnected graph on five vertices with discrete graphs
• On the crossing numbers of Cartesian products of small graphs with paths, cycles and stars
• On the crossing number of the join of the wheel on five vertices with the discrete graph
• On the crossing numbers of join products of \(W_4+P_n\) and \(W_4+C_n\)
• On the crossing number of the Cartesian product of a sunlet graph and a star graph
• Cyclic permutations in determining crossing numbers
• The influence of separating cycles in drawings of \(K_5 \setminus e\) in the join product with paths and cycles
• DETERMINING CROSSING NUMBERS OF GRAPHS OF ORDER SIX USING CYCLIC PERMUTATIONS
• On the brush number of the Cartesian product of tree with path or cycle
• The crossing number of \(K_{5,n+1} \setminus e\)
• Disconnected spanning subgraphs of paths in the join products with cycles
• On the crossing numbers of Cartesian products with trees
• A survey of graphs with known or bounded crossing numbers

This page was built for publication: On the crossing numbers of Cartesian products of wheels and trees

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