ON PROBLEMS OF -CONNECTED GRAPHS FOR

DOI10.1017/S000497272000129XzbMath1472.05115OpenAlexW3110289567MaRDI QIDQ4959262

Juraj Valiska, Michal Staš

Publication date: 13 September 2021

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s000497272000129x

zbMATH Keywords

complete bipartite graphcrossing numberoptimal drawingcrossing sequence

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (1)

On the problems of CF-connected graphs

Cites Work

• Unnamed Item
• The crossing numbers of join of the special graph on six vertices with path and cycle
• Zarankiewicz's conjecture is finite for each fixed \(m\)
• A SUFFICIENT CONDITION FOR A PAIR OF SEQUENCES TO BE BIPARTITE GRAPHIC
• Cyclic‐order graphs and Zarankiewicz's crossing‐number conjecture
• Characterizing all graphs with 2-exceptional edges
• The crossing number of K5,n
• On a problem of P. Turan concerning graphs

This page was built for publication: ON PROBLEMS OF -CONNECTED GRAPHS FOR