Independent and monochromatic absorbent sets in infinite digraphs

Independent and monochromatic absorbent sets in infinite digraphs

Let D be a digraph, we say that it is an m-coloured digraph if the arcs of D are coloured with at most m-colours. An (u,v) arc is symmetrical if (v,u) is also an arc of D. A directed path (resp. directed cycle) is monochromatic if all of its arcs are coloured with the same colour, and it is quasi-mo...

Full description

Bibliographic Details
Main Authors: Alejandro Contreras-Balbuena, Hortensia Galeana-Sánchez, Rocío Rojas-Monroy
Format: Article
Language:English
Published: Taylor & Francis Group 2015-11-01
Series:AKCE International Journal of Graphs and Combinatorics
Subjects:
Independence
Monochromatic absorbance
Infinite digraph
A-kernel
Online Access:http://www.sciencedirect.com/science/article/pii/S0972860015000328

Internet

http://www.sciencedirect.com/science/article/pii/S0972860015000328

Similar Items