Independent and monochromatic absorbent sets in infinite digraphs

DOI10.1016/J.AKCEJ.2015.11.005zbMath1346.05063OpenAlexW2282206614MaRDI QIDQ321991

Alejandro Contreras-Balbuena, Hortensia Galeana-Sánchez, Rocío Rojas-Monroy

Publication date: 14 October 2016

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.akcej.2015.11.005

zbMATH Keywords

independenceinfinite digraph\(\mathcal{A}\)-kernelmonochromatic absorbance

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Independent domination by monochromatic paths in arc coloured bipartite tournaments
• On monochromatic paths in m-coloured tournaments
• On monochromatic paths in edge-coloured digraphs
• Kernels in edge-colored digraphs
• On monochromatic paths and monochromatic 4-cycles in edge coloured bipartite tournaments
• On monochromatic paths and monochromatic cycles in edge coloured tournaments
• Reachability problems in edge-colored digraphs
• Monochromatic paths and monochromatic sets of arcs in bipartite tournaments

This page was built for publication: Independent and monochromatic absorbent sets in infinite digraphs