On the problems of CF-connected graphs

DOI10.5614/ejgta.2023.11.2.12zbMath1527.05045OpenAlexW4388085895MaRDI QIDQ6090328

Juraj Valiska, Michal Staš

Publication date: 16 December 2023

Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.5614/ejgta.2023.11.2.12

zbMATH Keywords

connectivitycrossing numbercomplete graphoptimal drawingcrossing sequence

Mathematics Subject Classification ID

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

Cites Work

• The crossing numbers of join of the special graph on six vertices with path and cycle
• Relations Between Crossing Numbers of Complete and Complete Bipartite Graphs
• ON PROBLEMS OF -CONNECTED GRAPHS FOR
• Closing in on Hill's Conjecture
• The crossing number of K₁₁ is 100
• On the Number of Crossings in a Complete Graph

This page was built for publication: On the problems of CF-connected graphs