Connected [a,b]-factors in graphs
From MaRDI portal
Publication:1603263
DOI10.1007/S004930200004zbMATH Open0989.05087OpenAlexW1999514683MaRDI QIDQ1603263FDOQ1603263
Authors: Mekkia Kouider, Maryvonne Mahéo 
Publication date: 25 June 2002
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004930200004
Recommendations
- Connected \([k,k+1]\)-factors of graphs
- Connected factors in graphs -- a survey
- Note on connected \((g, f)\)-factors of graphs
- Connected factors in \(K_{1,n}\)-free graphs containing an \([a,b]\)-factor
- Connected \(k\)-factors in bipartite graphs
- Connected \([a,b]\)-factors in \(K_{1,n}\)-free graphs containing an \([a,b]\)-factor
- On connencted \([g,f+1]\)-factors in graphs
- [a,b]‐factorizations of graphs
- Connected factors and spanning trees in graphs
- Even [a,b]-factors in graphs
Cited In (14)
- Note on connected \((g, f)\)-factors of graphs
- A degree condition for graphs to have connected \((g,f)\)-factors
- Embedding connected factorizations
- Factors and connected induced subgraphs
- \([2,3]\)-factors in a 3-connected infinite planar graph.
- Factors of disconnected graphs and polynomials with nonnegative integer coefficients
- Binding numbers and connected factors
- On 2-edge-connected \([\mathbf{a,b}]\)-factors of graphs with Ore-type condition
- Connected factors in \(K_{1,n}\)-free graphs containing an \([a,b]\)-factor
- Graph factors and factorization: 1985--2003: a survey
- Neighborhood union and connected \([k,k+1]\)-factors in graphs
- Two-edge-connected \([2,k]\)-factors in graphs
- Some sufficient conditions for graphs to have (g, f)-factors
- Title not available (Why is that?)
This page was built for publication: Connected \([a,b]\)-factors in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1603263)
