Minimum degree condition for a graph to be knitted

DOI10.1016/j.disc.2019.06.038zbMath1419.05048arXiv1811.07482OpenAlexW2963107223MaRDI QIDQ2324511

Gexin Yu, Runrun Liu, Martin Rolek

Publication date: 11 September 2019

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1811.07482

zbMATH Keywords

connectivityminimum degreegraph linkagecontraction-critical graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• Connectivities for \(k\)-knitted graphs and for minimal counterexamples to Hadwiger's conjecture
• On the connectivity of minimum and minimal counterexamples to Hadwiger's conjecture
• An improved linear edge bound for graph linkages
• Graph minors. XIII: The disjoint paths problem
• Homomorphieeigenschaften und mittlere Kantendichte von Graphen
• Über trennende Eckenmengen in homomorphiekritischen Graphen
• Eine Verallgemeinerung des \(n\)-fachen Zusammenhangs für Graphen
• Highly linked graphs
• Trennende Knotenpunktmengen und Reduzibilität abstrakter Graphen mit Anwendung auf das Vierfarbenproblem.
• On Sufficient Degree Conditions for a Graph to be $k$-linked
• Degree conditions for k‐ordered hamiltonian graphs
• On the Existence of Certain Configurations within Graphs and the 1-Skeletons of Polytopes
• An extremal problem for H‐linked graphs

This page was built for publication: Minimum degree condition for a graph to be knitted