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...

Celý popis

Podrobná bibliografia

Vydané v:	Journal of combinatorial theory. Series B Ročník 121; s. 284 - 307
Hlavní autori:	Kakimura, Naonori, Kawarabayashi, Ken-ichi
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Inc 01.11.2016
Predmet:	Coloring Fixed-parameter algorithm Immersion Coloring Fixed-parameter algorithm Immersion
ISSN:	0095-8956, 1096-0902
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!