Connected (g, f)-factors
From MaRDI portal
Publication:2778283
DOI10.1002/jgt.10019zbMath0995.05117OpenAlexW4238536928MaRDI QIDQ2778283
Yunsun Nam, Mark N. Ellingham, Heinz-Juergen Voss
Publication date: 24 October 2002
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.10019
Related Items (15)
Spanning trees and spanning closed walks with small degrees ⋮ Decomposing highly edge-connected graphs into homomorphic copies of a fixed tree ⋮ Decomposing highly edge-connected graphs into paths of any given length ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ Binding numbers and connected factors ⋮ Toughness and spanning trees in K4‐minor‐free graphs ⋮ Edge-decomposition of graphs into copies of a tree with four edges ⋮ The existence of \(f\)-forests and \(f\)-trees in graphs ⋮ Spanning trees: A survey ⋮ A toughness condition for a spanning tree with bounded total excesses ⋮ On a spanning \(k\)-tree in which specified vertices have degree less than \(k\) ⋮ Toughness in graphs -- a survey ⋮ Balancing two spanning trees ⋮ Spanning trees and spanning Eulerian subgraphs with small degrees ⋮ Spanning Trees with Vertices Having Large Degrees
Cites Work
- Unnamed Item
- On a connection between the existence of k-trees and the toughness of a graph
- Flows and generalized coloring theorems in graphs
- Some Ore-type conditions for the existence of connected \([2,k\)-factors in graphs]
- Toughness of graphs and \([2,b\)-factors]
- Connected \([k,k+1\)-factors of graphs]
- Toughness of graphs and the existence of factors
- Regular \(n\)-valent \(n\)-connected non-Hamiltonian non \(n\)-edge-colourable graphs
- On the Problem of Decomposing a Graph into n Connected Factors
- Edge-Disjoint Spanning Trees of Finite Graphs
- Hamiltonian ?-factors in graphs
- Toughness, trees, and walks
This page was built for publication: Connected (g, f)-factors
