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

DOI10.1016/j.disc.2008.01.002zbMath1170.05024OpenAlexW2009986993MaRDI QIDQ1011698

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

surface3-connected graphcircuit graph3-tree

Mathematics Subject Classification ID

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

Related Items

Computing Tutte Paths, Enumerative properties of rooted circuit maps, Proper orientations of planar bipartite graphs, Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey, Spanning closed walks and TSP in 3-connected planar graphs, Spanning trees: A survey, Spanning trees in 3-connected \(K_{3,t}\)-minor-free graphs, Types of triangle in Hamiltonian triangulations and an application to domination and k-walks, Spanning trees in 3-connected K3,t-minor-free graphs, Unnamed Item

Cites Work

• Unnamed Item
• Trees in triangulations
• 2-walks in circuit graphs
• Subgraphs of graphs on surfaces with high representativity
• Spanning planar subgraphs of graphs in the torus and Klein bottle
• A Theorem on Planar Graphs
• 2-connected 7-coverings of 3-connected graphs on surfaces
• 2‐connected coverings of bounded degree in 3‐connected graphs
• Trees in Polyhedral Graphs