Abstract
Let and be positive integers. We use to denote the path with vertices and to denote the complete bipartite graph with parts of size and respectively. The one-subdivision of is obtained by replacing every edge of by two edges and with a new vertex . In this paper, we give a polynomial-time algorithm for the list-three-coloring problem restricted to the class of -free graph with no induced 1-subdivision of .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.