A Dirac theorem for trestles

DOI10.1016/J.DISC.2012.03.011MaRDI QIDQ427855zbMATH OpenOpenAlexFDO

Authors Tomáš Kaiser, Zdeněk Ryjáček, Ingo Schiermeyer, Stanislav 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

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

Recommendations

• On k-trestles in polyhedreal graphs
• On 2-connected spanning subgraphs with low maximum degree
• On 2-connected spanning subgraphs with bounded degree in \(K _{1,r }\)-free graphs
• Subdivisions of graphs: A generalization of paths and cycles
• Trees through specified vertices

Cites work

• 2-connected spanning subgraphs of planar 3-connected graphs
• 2‐connected coverings of bounded degree in 3‐connected graphs
• scientific article; zbMATH DE number 863469 (Why is no real title available?)
• scientific article; zbMATH DE number 2203240 (Why is no real title available?)
• Long paths and large cycles in finite graphs
• On 2-connected spanning subgraphs with low maximum degree
• On \(3\)-connected plane graphs without triangular faces
• On k-trestles in polyhedreal graphs
• On maximal paths and circuits of graphs
• Some Theorems on Abstract Graphs

Cited in

(4)

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

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

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