On the edge numbers of graphs with Hadwiger number 4 and 5
From MaRDI portal
Publication:1055783
DOI10.1007/BF01848093zbMath0522.05037MaRDI QIDQ1055783
Publication date: 1982
Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01848093
05C35: Extremal problems in graph theory
Related Items
Tight upper bound on the number of edges in a bipartite \(K_{3,3}\)-free or \(K_{5}\)-free graph with an application., The extremal function for \(K_{9}\) minors
Cites Work