Colouring problems for symmetric configurations with block size 3
From MaRDI portal
Publication:6186660
DOI10.1002/jcd.21773arXiv2004.04514OpenAlexW3016112925MaRDI QIDQ6186660
Terry S. Griggs, Grahame Erskine, Jozef Širáň
Publication date: 2 February 2024
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.04514
Combinatorial aspects of block designs (05B05) Other designs, configurations (05B30) Blocking sets, ovals, (k)-arcs (51E21) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Unnamed Item
- Unnamed Item
- Irreducible \((v_{3})\) configurations and graphs
- Sign-nonsingular matrices and even cycles in directed graphs
- List-colourings of graphs
- Square critically 3-chromatic hypergraphs
- Blocking set free configurations and their relations to digraphs and hypergraphs
- Counting symmetric configurations \(v_3\)
- On the upper embedding of symmetric configurations with block size 3
- Practical graph isomorphism. II.
- Are These Figures Oxymora?
- The existence problem for colour critical linear hypergraphs
- 3K2-decomposition of a graph
- Det‐extremal cubic bipartite graphs
- Even dicycles
- Research problems
- Research problems
- Research problems