Regular colorings in regular graphs
From MaRDI portal
Publication:2175238
Recommendations
Cites work
- scientific article; zbMATH DE number 3726401 (Why is no real title available?)
- 3-Regular subgraphs and (3,1)-colorings of 4-regular pseudographs
- Brooks type results for conflict-free colorings and \(\{a, b \}\)-factors in graphs
- Factors and factorizations of graphs. Proof techniques in factor theory
- Graph factors and factorization: 1985--2003: a survey
- Graph theory with applications
- On the existence of general factors in regular graphs
- Regular factors of regular graphs
- Regular subpseudographs of regular pseudographs
- The Subgraph Problem
- The factorization of graphs. II
- Three-regular parts of four-regular graphs
- \(\{k,r-k\}\)-factors of \(r\)-regular graphs
Cited in
(11)- On the existence of graphs which can colour every regular graph
- Kaleidoscopic colorings of graphs
- Irregular colorings of regular graphs
- A graph coloring problem
- \(H\)-colorings for 4-regular graphs
- Network-Colourings
- The edge-chromatic class of regular graphs of degree 4 and their complements
- A note on \(\bar{X}\)-coloring and \(\hat{A}\)-coloring 4-regular graphs
- Kaleidoscopic edge-coloring of complete graphs and \(r\)-regular graphs
- scientific article; zbMATH DE number 5844210 (Why is no real title available?)
- Flip colouring of graphs
This page was built for publication: Regular colorings in regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2175238)