Research problems from the BCC22

DOI10.1016/J.DISC.2011.02.024MaRDI QIDQ893604zbMATH OpenOpenAlexFDO

Authors Peter J. Cameron

Publication date 20 November 2015

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2011.02.024

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02)

Cited in

(19)

• Towards obtaining a 3-decomposition from a perfect matching
• On the chromatic number of regular graphs of matrix algebras
• Computing Autotopism Groups of Partial Latin Rectangles
• Decomposing plane cubic graphs
• Decomposing graphs into a spanning tree, an even graph, and a star forest
• Edge decomposition of connected claw-free cubic graphs
• Bounds on the number of autotopisms and subsquares of a Latin square
• The sum of nonsingular matrices is often nonsingular
• Classification of the total and regular graphs of three-point sets
• Decomposing claw-free subcubic graphs and 4-chordal subcubic graphs
• Complete \(r\)-partite graphs determined by their domination polynomial
• On the chromatic number of structured Cayley graphs
• Decompositions of cubic traceable graphs
• Cospectral regular graphs with and without a perfect matching
• Chromatic number and clique number of subgraphs of regular graph of matrix algebras
• On a generalization of the Hadwiger-Nelson problem
• Triangulations of the sphere, bitrades and abelian groups
• On total and regular graphs of a polynomial
• Colorful paths for 3-chromatic graphs

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)