Bounded transversals in multipartite graphs

DOI10.1002/jgt.20618zbMath1244.05172OpenAlexW2100004673MaRDI QIDQ2897209

Penny E. Haxell, Tibor Szabó, Robert Berke

Publication date: 10 July 2012

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20618

zbMATH Keywords

transversalsmultipartite graphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Extremal problems for transversals in graphs with bounded degree
• Density conditions for triangles in multipartite graphs
• Relaxed two-coloring of cubic graphs
• The linear arboricity of graphs
• On complete subgraphs of \(r\)-chromatic graphs
• Independent transversals in \(r\)-partite graphs
• Bounded size components -- partitions and transversals.
• The number of complete subgraphs of equi-partite graphs
• A Note on Vertex List Colouring
• Odd Independent Transversals are Odd
• The strong chromatic number of a graph
• Complete Subgraphs of r-partite Graphs

This page was built for publication: Bounded transversals in multipartite graphs