Regular factors of regular graphs
From MaRDI portal
Publication:3752417
DOI10.1002/JGT.3190090107zbMATH Open0612.05049OpenAlexW2045256092MaRDI QIDQ3752417FDOQ3752417
Authors: Béla Bollobás, Akira Saito, Nicholas Wormald
Publication date: 1985
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190090107
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)
Cites Work
Cited In (34)
- Regular factors in regular graphs
- Sharp conditions for the existence of an even \([a,b]\)-factor in a graph
- Degree Ramsey numbers of graphs
- Maximally edge‐connected realizations and Kundu's k $k$‐factor theorem
- Regular factors and eigenvalues of regular graphs
- \(k\) -factors in regular graphs
- Title not available (Why is that?)
- Sharp Ore-type conditions for the existence of an even \([4,b]\)-factor in a graph
- Eigenvalues and [a,b]‐factors in regular graphs
- On the factor-thickness of regular graphs
- Cut-edges and regular factors in regular graphs of odd degree
- Regular factors of simple regular graphs and factor-spectra
- Equitable factorizations of edge-connected graphs
- \((g,f)\)-factors with special properties in bipartite \((mg,mf)\)-graphs
- Regular graphs, regular factors, and the impact of Petersen's theorems
- Almost all regular graphs are Hamiltonian
- Matching theory -- a sampler: From Dénes König to the present
- Factors of regular graphs
- \(\{k,r-k\}\)-factors of \(r\)-regular graphs
- Degree factors with red-blue coloring of regular graphs
- Factors in a class of regular digraphs
- The existence of even regular factors of regular graphs on the number of cut edges
- On the signed star domination number of regular multigraphs
- Regular graphs, eigenvalues and regular factors
- Regular colorings in regular graphs
- Eigenvalues and parity factors in graphs with given minimum degree
- Regular Graphs of High Degree are 1-Factorizable
- Graph factors and factorization: 1985--2003: a survey
- On a conjecture that strengthens Kundu's \(k\)-factor theorem
- Circuit decompositions and shortest circuit coverings of hypergraphs
- Colorful edge decomposition of graphs: some polynomial cases
- \(k\)-factors in regular graphs and edge-connectivity
- Title not available (Why is that?)
- \(f\)-factors in bipartite (\(mf\))-graphs
This page was built for publication: Regular factors of regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3752417)