An extremal problem for H‐linked graphs
From MaRDI portal
Publication:5711700
DOI10.1002/jgt.20115zbMath1078.05042MaRDI QIDQ5711700
Gexin Yu, Alexandr V. Kostochka
Publication date: 8 December 2005
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20115
05C35: Extremal problems in graph theory
Related Items
Rooted \(K_4\)-minors, On large semi-linked graphs, Pan-\(H\)-linked graphs, Connectivities for \(k\)-knitted graphs and for minimal counterexamples to Hadwiger's conjecture, Minimum degree conditions for \(H\)-linked graphs, A look at cycles containing specified elements of a graph, Degree conditions for the existence of vertex-disjoint cycles and paths: a survey, 7-connected graphs are 4-ordered, Minimum degree condition for a graph to be knitted, Recent advances on the Hamiltonian problem: survey III, On \(H\)-linked graphs, Optimal connectivity for fat-triangle linkages, Linkage for the diamond and the path with four vertices, Linkedness and Ordered Cycles in Digraphs, Implications among linkage properties in graphs