Factorizing regular graphs
From MaRDI portal
Publication:2284748
Recommendations
Cites work
- A Reduction Method for Edge-Connectivity in Graphs
- Counterexamples to Jaeger's circular flow conjecture
- Graph factors modulo k
- Graph theory with applications
- Graphs on surfaces
- Group flow, complex flow, unit vector flow, and the (2 + )-flow conjecture
- scientific article; zbMATH DE number 3904637 (Why is no real title available?)
- scientific article; zbMATH DE number 4075098 (Why is no real title available?)
- scientific article; zbMATH DE number 821271 (Why is no real title available?)
- Nowhere-zero 3-flows and modulo \(k\)-orientations
- Regular n-valent n-connected non-Hamiltonian non n-edge-colourable graphs
- The equivalence of two conjectures of Berge and Fulkerson
- The weak 3-flow conjecture and the weak circular flow conjecture
Cited in
(14)- Factors of regular graphs
- Equitable factorizations of edge-connected graphs
- Regular factors in regular graphs
- scientific article; zbMATH DE number 5130724 (Why is no real title available?)
- Factors in a class of regular digraphs
- Isomorphic Factorization of Regular Graphs and 3-Regular Multigraphs
- Highly edge‐connected regular graphs without large factorizable subgraphs
- Modulo orientations with bounded out-degrees
- Maximally edge‐connected realizations and Kundu's k k‐factor theorem
- Pairwise Disjoint Perfect Matchings in r-Edge-Connected r-Regular Graphs
- Homomorphisms to small negative even cycles
- Edge-connectivity and pairwise disjoint perfect matchings in regular graphs
- On a conjecture that strengthens Kundu's k-factor theorem
- Non-conflicting no-where zero Z₂ Z₂-flows in cubic graphs
This page was built for publication: Factorizing regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2284748)