Coloring immersion-free graphs

A graph H is immersed in a graph G if the vertices of H are mapped to (distinct) vertices of G, and the edges of H are mapped to paths joining the corresponding pairs of vertices of G, in such a way that the paths are pairwise edge-disjoint. The notion of an immersion is quite similar to the well-kn...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of combinatorial theory. Series B Vol. 121; pp. 284 - 307
Main Authors:	Kakimura, Naonori, Kawarabayashi, Ken-ichi
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.11.2016
Subjects:	Coloring Fixed-parameter algorithm Immersion Coloring Fixed-parameter algorithm Immersion
ISSN:	0095-8956, 1096-0902
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!