The 1-Color Problem and the Brylawski Model
From MaRDI portal
Publication:3648813
DOI10.1007/978-3-642-04397-0_45zbMath1261.68149OpenAlexW1543198957MaRDI QIDQ3648813
Simone Rinaldi, Stefano Brocchi, Andrea Frosini
Publication date: 1 December 2009
Published in: Discrete Geometry for Computer Imagery (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-04397-0_45
Related Items (2)
New sufficient conditions on the degree sequences of uniform hypergraphs ⋮ On the Degree Sequence of 3-Uniform Hypergraph: A New Sufficient Condition
Cites Work
- Games on line graphs and sand piles
- Sandpiles and order structure of integer partitions
- Discrete tomography. Foundations, algorithms, and applications
- The lattice of integer partitions
- Sandpile models and lattices: a comprehensive survey
- Advances in discrete tomography and its applications. Some papers based on the presentations at the workshop on discrete tomography and its applications, New York, NY, USA, June 13--15, 2005.
- Combinatorial Properties of Matrices of Zeros and Ones
- Solving Some Instances of the 2-Color Problem
This page was built for publication: The 1-Color Problem and the Brylawski Model
