Independent coverings and orthogonal colourings

DOI10.1016/j.disc.2021.112431zbMath1466.05186arXiv2008.07904OpenAlexW3154417085MaRDI QIDQ2032848

Kyle MacKeigan

Publication date: 14 June 2021

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

Full work available at URL: https://arxiv.org/abs/2008.07904

zbMATH Keywords

tree graphindependent transversalindependent coveringorthogonal colouringsparse partite graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Transversal (matching) theory (05D15) Density (toughness, etc.) (05C42)

Related Items (2)

On factors of independent transversals in \(k\)-partite graphs ⋮ Packing list‐colorings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Upper bounds on sets of orthogonal colorings of graphs
• On complete subgraphs of \(r\)-chromatic graphs
• A short proof of the existence of highly chromatic hypergraphs without short cycles
• Orthogonal colorings of graphs
• Orthogonal colourings of Cayley graphs
• Independent transversals in locally sparse graphs
• A Note on Vertex List Colouring
• Independent Transversals and Independent Coverings in Sparse Partite Graphs
• Independent Transversals in Sparse Partite Hypergraphs

This page was built for publication: Independent coverings and orthogonal colourings