A Dirac theorem for trestles

DOI10.1016/j.disc.2012.03.011zbMath1243.05121OpenAlexW2076217597MaRDI QIDQ427855

Tomáš Kaiser, Ingo Schiermeyer, Zdeněk Ryjáček, Stanlislav Jendroľ

Publication date: 18 June 2012

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

Full work available at URL: https://doi.org/10.1016/j.disc.2012.03.011

zbMATH Keywords

minimum degreetrestle

Mathematics Subject Classification ID

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

Related Items (3)

The proper 2-connection number and size of graphs ⋮ Derivation of the functional renormalization group \(\beta\)-function at order \(1/N\) for manifolds pinned by disorder ⋮ Trestles in the squares of graphs

Cites Work

• On 2-connected spanning subgraphs with low maximum degree
• 2-connected spanning subgraphs of planar 3-connected graphs
• On \(3\)-connected plane graphs without triangular faces
• On maximal paths and circuits of graphs
• Long paths and large cycles in finite graphs
• On k-trestles in polyhedreal graphs
• 2‐connected coverings of bounded degree in 3‐connected graphs
• Some Theorems on Abstract Graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: A Dirac theorem for trestles