The crossing numbers of join of special disconnected graph on five vertices with discrete graphs

DOI10.1007/S00373-021-02423-5zbMATH Open1484.05145OpenAlexW4210497133MaRDI QIDQ2115148FDOQ2115148

Marián Klešč, Jana Petrillová, Michal Staš

Publication date: 15 March 2022

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-021-02423-5

Recommendations

• On the crossing number of join product of the discrete graph with special graphs of order five
• Determining crossing number of join of the discrete graph with two symmetric graphs of order five
• On the crossing numbers of join products of five graphs of order six with the discrete graph
• On the crossing numbers of join products of four graphs of order six with the discrete graph
• The crossing numbers of join products of paths with three graphs of order five

zbMATH Keywords

graph drawingcrossing numberjoin productvertex rotation

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Planar graphs; geometric and topological aspects of graph theory (05C10) Enumeration in graph theory (05C30) Paths and cycles (05C38) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Crossing Number is NP-Complete
• Cyclic‐order graphs and Zarankiewicz's crossing‐number conjecture
• The crossing number of K5,n
• The crossing numbers of join of the special graph on six vertices with path and cycle
• A New Approach to Exact Crossing Minimization
• The optimal drawings of \(K_{5,n}\)
• Characterization of join graphs with crossing number zero
• The crossing numbers of join products of paths with graphs of order four
• The Join of Graphs and Crossing Numbers
• On the crossing numbers of Cartesian products of wheels and trees
• Experiments on exact crossing minimization using column generation
• The crossing numbers of Cartesian products of paths with 5-vertex graphs
• A branch-and-cut approach to the crossing number problem
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (5)

• The crossing numbers of join products of four graphs of order five with paths and cycles
• The crossing number of the generalized Petersen graph P(3k,k) in the projective plane
• Title not available (Why is that?)
• The crossing number of nearly complete bipartite graphs
• Title not available (Why is that?)

This page was built for publication: The crossing numbers of join of special disconnected graph on five vertices with discrete graphs

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