Graph-Theoretic Concepts in Computer Science

DOI10.1007/b93953zbMath1255.05084MaRDI QIDQ5902536

Ioan Todinca

Publication date: 12 January 2010

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

Mathematics Subject Classification ID

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

Related Items (11)

Computing L(p,1)-Labeling with Combined Parameters ⋮ On powers of graphs of bounded NLC-width (clique-width) ⋮ Graph classes with and without powers of bounded clique-width ⋮ The Clique-Width of Tree-Power and Leaf-Power Graphs ⋮ Computing \(L(p, 1)\)-labeling with combined parameters ⋮ Line graphs of bounded clique-width ⋮ Rooted directed path graphs are leaf powers ⋮ Vertex disjoint paths on clique-width bounded graphs ⋮ Ptolemaic Graphs and Interval Graphs Are Leaf Powers ⋮ The NLC-width and clique-width for powers of graphs of bounded tree-width ⋮ On the relationship between NLC-width and linear NLC-width

This page was built for publication: Graph-Theoretic Concepts in Computer Science