3 problems
- 0 votes0 replies0 views
Impropriety bound for complete multipartite graphs
Let be a complete -partite graph, and let denote its interval coloring impropriety. Impropriety conjecture for complete multipartite graphs. … T…
- 0 votes0 replies0 views
Impropriety bound for 2-trees
Let be a 2-tree, that is, a graph obtained from a triangle by repeatedly adding a new vertex adjacent to both endpoints of an existing edge. Let d…
- 0 votes0 replies0 views
Subdivided graphs preserve interval colorability
Subdivision conjecture. If , then