List homomorphism: beyond the known boundaries
From MaRDI portal
Publication:6164000
DOI10.1007/978-3-031-20624-5_36MaRDI QIDQ6164000
Satyabrata Jana, Shaily Verma, Fahad Panolan, Saket Saurabh, Sriram Bhyravarapu
Publication date: 26 July 2023
Published in: LATIN 2022: Theoretical Informatics (Search for Journal in Brave)
Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- List H-coloring a graph by removing few vertices
- The complexity of the list homomorphism problem for graphs
- List matrix partitions of chordal graphs
- Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time
- List homomorphisms to reflexive graphs
- Algorithmic complexity of list colorings
- Generalized coloring for tree-like graphs
- Counting \(H-\)colorings of partial \(k-\)trees
- List matrix partitions of graphs representing geometric configurations
- List homomorphisms and circular arc graphs
- On list \(k\)-coloring convex bipartite graphs
- List Partitions
- Bi‐arc graphs and the complexity of list homomorphisms
- On List Coloring and List Homomorphism of Permutation and Interval Graphs
- Parameterized Algorithms
- Fine-Grained Complexity of the Graph Homomorphism Problem for Bounded-Treewidth Graphs
- List homomorphisms to separable signed graphs
This page was built for publication: List homomorphism: beyond the known boundaries
