Coloring by two-way independent sets
From MaRDI portal
Publication:1044959
DOI10.1016/j.disc.2008.07.007zbMath1213.05063OpenAlexW2024081199MaRDI QIDQ1044959
Publication date: 15 December 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2008.07.007
Combinatorial aspects of matroids and geometric lattices (05B35) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Unnamed Item
- On rainbow matchings in bipartite graphs
- On the fractional matching polytope of a hypergraph
- The clique complex and hypergraph matching
- Matching theory
- Maximum degree and fractional matchings in uniform hypergraphs
- Triangulated spheres and colored cliques
- A tree version of Kőnig's theorem
- A condition for matchability in hypergraphs
- Independent systems of representatives in weighted graphs
- Matroid Intersection
- The intersection of a matroid and a simplicial complex
- A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring
- Orthogonal Latin Rectangles
- Hall's theorem for hypergraphs
- On the Strong Chromatic Number
- Lehmans switching game and a theorem of Tutte and Nash-Williams
- The Factors of Graphs
This page was built for publication: Coloring by two-way independent sets