Coloring powers of graphs of bounded clique-width.

DOI10.1007/B93953MaRDI QIDQ5902536zbMATH OpenFDO

Authors Ioan Todinca

Publication date 12 January 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/B93953

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• On powers of graphs of bounded NLC-width (clique-width)
• Polynomial algorithms for partitioning problems on graphs with fixed clique-width (extended abstract)
• Edge dominating set and colorings on graphs with fixed clique-width
• Algorithms for vertex-partitioning problems on graphs with fixed clique-width.
• MSOL partitioning problems on graphs of bounded treewidth and clique-width

Cited in

(14)

• The NLC-width and clique-width for powers of graphs of bounded tree-width
• Computing \(L(p, 1)\)-labeling with combined parameters
• On powers of graphs of bounded NLC-width (clique-width)
• Line graphs of bounded clique-width
• Vertex disjoint paths on clique-width bounded graphs
• On the relationship between NLC-width and linear NLC-width
• Polynomial algorithms for partitioning problems on graphs with fixed clique-width (extended abstract)
• The Clique-Width of Tree-Power and Leaf-Power Graphs
• Computing L(p,1)-Labeling with Combined Parameters
• Ptolemaic Graphs and Interval Graphs Are Leaf Powers
• A novel discussion on power fuzzy graphs and their application in decision making
• On regular power fuzzy graphs
• Graph classes with and without powers of bounded clique-width
• Rooted directed path graphs are leaf powers

This page was built for publication: Coloring powers of graphs of bounded clique-width.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5902536)