On problems of CF-connected graphs for K_m,n

DOI10.1017/S000497272000129XMaRDI QIDQ4959262zbMATH OpenOpenAlexFDO

Authors Michal Staš, Juraj Valiska

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)

Recommendations

• The conjecture on the crossing number of \(K_{1, m, n}\) is true if Zarankiewicz's conjecture holds
• scientific article; zbMATH DE number 2156833
• The crossing number of \(K_{1,m,n}\)
• Cyclic‐order graphs and Zarankiewicz's crossing‐number conjecture
• Crossing numbers of graphs

Cites work

• scientific article; zbMATH DE number 3306563 (Why is no real title available?)
• A sufficient condition for a pair of sequences to be bipartite graphic
• Characterizing all graphs with 2-exceptional edges
• Cyclic‐order graphs and Zarankiewicz's crossing‐number conjecture
• On a problem of P. Turan concerning graphs
• The crossing number of K5,n
• 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\)

Cited in

(2)

• On the problems of CF-connected graphs
• Disconnected spanning subgraphs of paths in the join products with cycles

This page was built for publication: On problems of \(\mathcal{CF}\)-connected graphs for \({K}_{{m,n}} \)

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