On the problems of CF-connected graphs

DOI10.5614/EJGTA.2023.11.2.12MaRDI QIDQ6090328zbMATHOpenAlexFDO

Authors Michal Staš, Juraj Valiska

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

connectivitycomplete graphcrossing numberoptimal drawingcrossing sequence

Mathematics Subject Classification ID

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

Recommendations

• [[:Publication:4959262|On problems of \(\mathcal{CF}\)-connected graphs for \({K}_Template:M,n \)]]
• The crossing number of seq-shellable drawings of complete graphs
• Relations Between Crossing Numbers of Complete and Complete Bipartite Graphs
• Crossing numbers of graphs
• The crossing number of the cone of a graph

Cites work

• Closing in on Hill's conjecture
• On problems of \(\mathcal{CF}\)-connected graphs for \({K}_{{m,n}} \)
• On the Number of Crossings in a Complete Graph
• Relations Between Crossing Numbers of Complete and Complete Bipartite Graphs
• The crossing number of K₁₁ is 100
• The crossing numbers of join of the special graph on six vertices with path and cycle

Cited in

(2)

• scientific article; zbMATH DE number 1114019 (Why is no real title available?)
• scientific article; zbMATH DE number 3910097 (Why is no real title available?)

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

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