List 3-coloring on comb-convex and caterpillar-convex bipartite graphs
From MaRDI portal
Publication:6591467
DOI10.1007/978-3-031-49190-0_12MaRDI QIDQ6591467
Banu Baklan Şen, Thomas Erlebach, Öznur Yaşar Diner
Publication date: 22 August 2024
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs
- Graph classes with structured neighborhoods and algorithmic applications
- Solving problems on generalized convex graphs via mim-width
- Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time
- The complexity of colouring problems on dense graphs
- Some results concerning the complexity of restricted colorings of graphs
- Precoloring extension. I: Interval graphs
- Algorithmic complexity of list colorings
- Complexity of list coloring problems with a fixed total number of colors
- Generalized coloring for tree-like graphs
- Three-coloring and list three-coloring of graphs without induced paths on seven vertices
- Three complexity results on coloring \(P_k\)-free graphs
- On list \(k\)-coloring convex bipartite graphs
- List 3-coloring \(P_t\)-free graphs with no induced 1-subdivision of \(K_{1 , s}\)
- List \(k\)-colouring \(P_t\)-free graphs: a mim-width perspective
- List coloring in the absence of a linear forest
- List coloring in the absence of two subgraphs
- A Simple Test for the Consecutive Ones Property
- On List Coloring and List Homomorphism of Permutation and Interval Graphs
- On Planar Supports for Hypergraphs
This page was built for publication: List 3-coloring on comb-convex and caterpillar-convex bipartite graphs
