Research problems from the BCC21

DOI10.1016/J.DISC.2009.04.016zbMath1197.05001OpenAlexW2096902116MaRDI QIDQ960934

Peter J. Cameron

Publication date: 29 March 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

open problems

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorial aspects of partitions of integers (05A17) Permutations, words, matrices (05A05) Proceedings, conferences, collections, etc. pertaining to combinatorics (05-06) Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Orthogonal arrays, Latin squares, Room squares (05B15) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

Row‐Hamiltonian Latin squares and Falconer varieties ⋮ Properties, isomorphisms and enumeration of 2-quasi-magic sudoku grids ⋮ On the Complexity of Computing the Excessive [B-Index of a Graph]

This page was built for publication: Research problems from the BCC21