On the problems of CF-connected graphs

DOI10.5614/EJGTA.2023.11.2.12zbMATH Open1527.05045OpenAlexW4388085895MaRDI QIDQ6090328FDOQ6090328

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)

Cites Work

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

Cited In (2)

• Title not available (Why is that?)
• Title not available (Why is that?)

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)