scientific article

DOI<link itemprop=identifier href="https://doi.org/10.1002/1097-0118(200102)36:2<67::AID-JGT2>3.0.CO;2-C" /><67::AID-JGT2>3.0.CO;2-C 10.1002/1097-0118(200102)36:2<67::AID-JGT2>3.0.CO;2-CzbMath0973.05023MaRDI QIDQ2707974

Daniel P. Sanders, Yue Zhao

Publication date: 3 December 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Euler characteristicspanning treedischarging methodspanning walktree-minimalwalk-minimal

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35)

Related Items (6)

The number of defective colorings of graphs on surfaces ⋮ On 2-connected spanning subgraphs with low maximum degree ⋮ Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey ⋮ Spanning trees: A survey ⋮ Spanning trees in 3-connected \(K_{3,t}\)-minor-free graphs ⋮ Spanning trees in 3-connected K3,t-minor-free graphs

Cites Work

• On 2-connected spanning subgraphs with low maximum degree
• Orientable and non orientable genus of the complete bipartite graph
• Trees in triangulations
• 2-walks in circuit graphs
• 3-trees in polyhedral maps
• Spanning planar subgraphs of graphs in the torus and Klein bottle
• Das Geschlecht des vollständigen paaren Graphen
• On the genus and connectivity of Hamiltonian graphs
• Removable edges in 3-connected graphs
• Der vollständige paare Graph auf nichtorientierbaren Flächen.
• Trees in Polyhedral Graphs

This page was built for publication: