On List Coloring and List Homomorphism of Permutation and Interval Graphs
From MaRDI portal
Publication:5246080
DOI10.1137/13090465XzbMath1309.05069arXiv1206.5106MaRDI QIDQ5246080
Gábor Tardos, Jessica Enright, Lorna K. Stewart
Publication date: 17 April 2015
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1206.5106
Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (9)
Complexity of \(C_k\)-coloring in hereditary classes of graphs ⋮ Dynamic coloring on restricted graph classes ⋮ List homomorphism: beyond the known boundaries ⋮ List matrix partitions of graphs representing geometric configurations ⋮ Unnamed Item ⋮ Graph partitions with prescribed patterns ⋮ On \(H\)-topological intersection graphs ⋮ On list \(k\)-coloring convex bipartite graphs ⋮ Open Problems on Graph Coloring for Special Graph Classes
This page was built for publication: On List Coloring and List Homomorphism of Permutation and Interval Graphs