3-Regular subgraphs and (3,1)-colorings of 4-regular pseudographs
From MaRDI portal
(Redirected from Publication:5264756)
Recommendations
- Three-regular subgraphs of four-regular graphs
- 3-colorability of 4-regular hamiltonian graphs
- Coloring of pseudocubic graphs in three colors
- scientific article; zbMATH DE number 1456823
- Non-repetitive 3-coloring of subdivided graphs
- 3-colorability of pseudo-triangulations
- scientific article; zbMATH DE number 930115
- 3-colourability and forbidden subgraphs
- Not-all-equal 3-SAT and 2-colorings of 4-regular 4-uniform hypergraphs
- 3-colorable subclasses of \(P_8\)-free graphs
Cites work
- [a,b]-factors of graphs
- A combinatorial problem on finite Abelian groups. II
- A simple existence criterion for \((g<f)\)-factors
- Combinatorial Nullstellensatz
- Degree constrained subgraphs
- Every 4-regular graph plus an edge contains a 3-regular subgraph
- Factors of regular graphs
- General antifactors of graphs
- General factors of graphs
- Graph theory
- scientific article; zbMATH DE number 3882549 (Why is no real title available?)
- scientific article; zbMATH DE number 3587078 (Why is no real title available?)
- scientific article; zbMATH DE number 1432797 (Why is no real title available?)
- scientific article; zbMATH DE number 1456823 (Why is no real title available?)
- Regular subgraphs of almost regular graphs
- Subgraphs with prescribed valencies
- The Subgraph Problem
- Three-regular parts of four-regular graphs
- Three-regular subgraphs of four-regular graphs
- Three‐regular subgraphs of four‐regular graphs
Cited in
(4)
This page was built for publication: 3-Regular subgraphs and (3,1)-colorings of 4-regular pseudographs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5264756)
