Cited in
(22)- On the chromatic number of structured Cayley graphs
- Decomposing graphs into a spanning tree, an even graph, and a star forest
- The sum of nonsingular matrices is often nonsingular
- Towards obtaining a 3-decomposition from a perfect matching
- Decompositions of cubic traceable graphs
- On the chromatic number of regular graphs of matrix algebras
- Chromatic number and clique number of subgraphs of regular graph of matrix algebras
- Bounds on the number of autotopisms and subsquares of a Latin square
- Decomposing claw-free subcubic graphs and 4-chordal subcubic graphs
- On total and regular graphs of a polynomial
- Cospectral regular graphs with and without a perfect matching
- Triangulations of the sphere, bitrades and abelian groups
- Colorful paths for 3-chromatic graphs
- On a generalization of the Hadwiger-Nelson problem
- Computing Autotopism Groups of Partial Latin Rectangles
- Classification of the total and regular graphs of three-point sets
- Small antiperfect Steiner triple systems
- Hoffmann-Ostenhof's 3-decomposition conjecture
- The 3-decomposition conjecture of cubic graphs
- Edge decomposition of connected claw-free cubic graphs
- Decomposing plane cubic graphs
- Complete r-partite graphs determined by their domination polynomial
This page was built for publication: Research problems from the BCC22
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q893604)
