k-NLC graphs and polynomial algorithms
Discrete Applied Mathematics - Special issue: efficient algorithms and partial k-trees
Upper bounds to the clique width of graphs
Discrete Applied Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Edge dominating set and colorings on graphs with fixed clique-width
Discrete Applied Mathematics
How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
On the Relationship Between Clique-Width and Treewidth
SIAM Journal on Computing
Approximating clique-width and branch-width
Journal of Combinatorial Theory Series B
Clique-width: on the price of generality
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
The NLC-width and clique-width for powers of graphs of bounded tree-width
Discrete Applied Mathematics
Complexity and algorithms for well-structured k-SAT instances
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Algorithmic lower bounds for problems parameterized by clique-width
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Compact labelings for efficient first-order model-checking
Journal of Combinatorial Optimization
Intractability of Clique-Width Parameterizations
SIAM Journal on Computing
Computing square roots of trivially perfect and threshold graphs
Discrete Applied Mathematics
| Hi-index | 0.04 |
Given a graph G, the graph Gl has the same vertex setand two vertices are adjacent in Gl if and only if theyare at distance at most l in G. The l-coloring problem consists infinding an optimal vertex coloring of the graph Gl,where G is the input graph. We show that, for any fixed value of l,the l-coloring problem is polynomial when restricted to graphs ofbounded NLC-width (or clique-width), if an expression of the graphis also part of the input. We also prove that the NLC-width ofGl is at most 2(l+1)nlcw(G).