Gallai colorings and domination in multipartite digraphs
From MaRDI portal
Publication:4650182
DOI10.1002/jgt.20646zbMath1305.05076arXiv1006.2044MaRDI QIDQ4650182
Ágnes Tóth, András Gyárfás, Gábor Simonyi
Publication date: 23 November 2012
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1006.2044
05C15: Coloring of graphs and hypergraphs
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
05C20: Directed graphs (digraphs), tournaments
Related Items
Partitioning 2-edge-colored graphs by monochromatic paths and cycles, Domination and fractional domination in digraphs
Cites Work
- Rainbow generalizations of Ramsey theory: A survey
- Colored graphs without colorful cycles
- Cycles in dense digraphs
- Gallai colorings of non-complete graphs
- Decomposing complete edge-chromatic graphs and hypergraphs. Revisited
- A note on perfect graphs
- Perfect couples of graphs
- Fractional kernels in digraphs
- Normal hypergraphs and the perfect graph conjecture
- Lambda composition
- Edge colorings of complete graphs without tricolored triangles
- Transitiv orientierbare Graphen
- Graph pairs and their entropies: Modularity problems