The crossing numbers of join of special disconnected graph on five vertices with discrete graphs
From MaRDI portal
Publication:2115148
DOI10.1007/s00373-021-02423-5zbMath1484.05145OpenAlexW4210497133MaRDI QIDQ2115148
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
Permutations, words, matrices (05A05) Enumeration in graph theory (05C30) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (3)
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 ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The optimal drawings of \(K_{5,n}\)
- On the crossing numbers of Cartesian products of wheels and trees
- A branch-and-cut approach to the crossing number problem
- 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
- Crossing Number is NP-Complete
- The Join of Graphs and Crossing Numbers
- A New Approach to Exact Crossing Minimization
- Cyclic‐order graphs and Zarankiewicz's crossing‐number conjecture
- Experiments on exact crossing minimization using column generation
- The crossing number of K5,n
- The crossing numbers of Cartesian products of paths with 5-vertex graphs
This page was built for publication: The crossing numbers of join of special disconnected graph on five vertices with discrete graphs