Independent Transversals and Independent Coverings in Sparse Partite Graphs
From MaRDI portal
Publication:3123116
DOI10.1017/S0963548396002763zbMath0882.05104OpenAlexW1990479896WikidataQ127332231 ScholiaQ127332231MaRDI QIDQ3123116
Publication date: 6 March 1997
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548396002763
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
On factors of independent transversals in \(k\)-partite graphs, An average degree condition for independent transversals, A General Framework for Hypergraph Coloring, Polynomial treewidth forces a large grid-like-minor, Independent coverings and orthogonal colourings