3-trees with few vertices of degree 3 in circuit graphs

DOI10.1016/J.DISC.2008.01.002MaRDI QIDQ1011698zbMATH OpenOpenAlexFDO

Authors Atsuhiro Nakamoto, Yoshiaki Oda, Katsuhiro Ota

Publication date 9 April 2009

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

3-connected graph3-treecircuit graphsurface

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38)

Recommendations

• Spanning Trees with Bounded Maximum Degrees of Graphs on Surfaces
• Number of vertices of degree three in spanning 3-trees in square graphs
• Trees and Co-trees with Bounded Degrees in Planar 3-connected Graphs
• A note on a spanning 3-tree
• scientific article; zbMATH DE number 4008429

Cites work

• 2-connected 7-coverings of 3-connected graphs on surfaces
• 2-walks in circuit graphs
• 2‐connected coverings of bounded degree in 3‐connected graphs
• A Theorem on Planar Graphs
• scientific article; zbMATH DE number 786140 (Why is no real title available?)
• Spanning planar subgraphs of graphs in the torus and Klein bottle
• Subgraphs of graphs on surfaces with high representativity
• Trees in Polyhedral Graphs
• Trees in triangulations

Cited in

(15)

• Proper orientations of planar bipartite graphs
• Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey
• On spanning trees and walks of low maximum degree
• Spanning trees in 3-connected \(K_{3,t}\)-minor-free graphs
• Trees and Co-trees with Bounded Degrees in Planar 3-connected Graphs
• scientific article; zbMATH DE number 3957150 (Why is no real title available?)
• Spanning closed walks and TSP in 3-connected planar graphs
• Computing Tutte paths
• Types of triangle in Hamiltonian triangulations and an application to domination and \(k\)-walks
• Spanning closed walks and TSP in 3-connected planar graphs
• Enumerative properties of rooted circuit maps
• Spanning trees: A survey
• 2-connected spanning subgraphs of circuit graphs
• Sufficient conditions for k-factors and spanning trees of graphs
• Spanning trees in 3-connected \(K_{3,t}\)-minor-free graphs

This page was built for publication: 3-trees with few vertices of degree 3 in circuit graphs

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