Cycles in squares of trees without generalized claws

DOI10.1016/J.DISC.2012.06.022MaRDI QIDQ383769zbMATH OpenOpenAlexFDO

Authors Stephan Brandt, Janina Müttel, Dieter Rautenbach

Publication date 6 December 2013

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

circumferencecaterpillarsquare of a treesubdivided claw

Mathematics Subject Classification ID

Trees (05C05)

Recommendations

• scientific article; zbMATH DE number 3941580
• Characterizations of non-singular cycles and trees
• Cycle traversability for claw-free graphs and polyhedral maps
• Cycles through particular subgraphs of claw‐free graphs
• scientific article; zbMATH DE number 18284
• Sequences, claws and cyclability of graphs
• scientific article; zbMATH DE number 4052339
• scientific article; zbMATH DE number 15360
• scientific article; zbMATH DE number 1322577
• scientific article; zbMATH DE number 147642

Cites work

• Hamiltonian results inK1,3-free graphs
• In the square of graphs, Hamiltonicity and pancyclicity, Hamiltonian connectedness and panconnectedness are equivalent concepts
• Induced \(S(K_{1,3})\) and hamiltonian cycles in the square of a graph
• The circumference of the square of a connected graph
• The square of a connected S(K1,3)-free graph is vertex pancyclic
• The square of every two-connected graph is Hamiltonian
• Trees with Hamiltonian square

This page was built for publication: Cycles in squares of trees without generalized claws

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