Cooperative colorings and independent systems of representatives
From MaRDI portal
Publication:2346466
zbMath1325.05073MaRDI QIDQ2346466
Philipp Sprüssel, Ron Holzman, David M. Howard, Ron Aharoni
Publication date: 2 June 2015
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v22i2p27
Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (4)
Cooperative colorings of forests ⋮ Fair Representation by Independent Sets ⋮ Cooperative colorings of trees and of bipartite graphs ⋮ Transversal factors and spanning trees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a lower bound for the connectivity of the independence complex of a graph
- Extremal problems for transversals in graphs with bounded degree
- The clique complex and hypergraph matching
- Independence number of 2-factor-plus-triangles graphs
- A solution to a colouring problem of P. Erdős
- The Hamiltonian property of consecutive-\(d\) digraphs
- Independent transversals in \(r\)-partite graphs
- Domination numbers and homology
- Asymptotically the list colouring constants are 1
- A condition for matchability in hypergraphs
- Independent transversals in locally sparse graphs
- Independent systems of representatives in weighted graphs
- Eigenvalues and homology of flag complexes and vector representations of graphs
- A Note on Vertex List Colouring
- Eigenvalues of K1,k-Free Graphs and the Connectivity of Their Independence Complexes
- Complete Subgraphs of r-partite Graphs
- Hall's theorem for hypergraphs
- On a list coloring conjecture of Reed
This page was built for publication: Cooperative colorings and independent systems of representatives
