2‐connected coverings of bounded degree in 3‐connected graphs

DOI10.1002/JGT.3190200309zbMATH Open0838.05034OpenAlexW2087072393MaRDI QIDQ4857433FDOQ4857433

Authors: Zhicheng Gao 

Publication date: 30 May 1996

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190200309

Recommendations

• 2-connected spanning subgraphs with low maximum degree in locally planar graphs
• 2-connected spanning subgraphs of planar 3-connected graphs
• scientific article; zbMATH DE number 871189
• 2-connected 7-coverings of 3-connected graphs on surfaces
• Subgraphs of graphs on surfaces with high representativity

zbMATH Keywords

torusmaximum degreespherecoveringsKlein bottle3-connected graph2-connected spanning subgraph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites Work

• Graph theory with applications
• Trees in Polyhedral Graphs

Cited In (20)

• Rooted minors and locally spanning subgraphs
• 2-connected 7-coverings of 3-connected graphs on surfaces
• Two local and one global properties of 3-connected graphs on compact 2-dimensional manifolds
• Embedding coverings of 2-paths with 3-paths
• 2-connected spanning subgraphs with low maximum degree in locally planar graphs
• A Dirac theorem for trestles
• 3-trees in polyhedral maps
• Local neighbor-distinguishing index of graphs
• On 2-connected spanning subgraphs with low maximum degree
• \([2,3]\)-factors in a 3-connected infinite planar graph.
• Long cycles in graphs on a fixed surface
• Enumerative properties of rooted circuit maps
• On \(3\)-connected plane graphs without triangular faces
• 2-connected spanning subgraphs of circuit graphs
• 3-trees with few vertices of degree 3 in circuit graphs
• Face-width of embedded graphs
• Subgraphs of graphs on surfaces with high representativity
• 2-IRREDUCIBILITY OF SPATIAL GRAPHS
• On certain spanning subgraphs of embeddings with applications to domination
• Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey

This page was built for publication: 2‐connected coverings of bounded degree in 3‐connected graphs

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