scientific article; zbMATH DE number 2044920

zbMATH Open1042.68620MaRDI QIDQ4448745FDOQ4448745

Authors: Haiko Müller, Maw-Shang Chang 

Publication date: 18 February 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2204/22040044.htm

Title of this publication is not available (Why is that?)

Recommendations

• scientific article
• Tree representations of graphs
• On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree
• Tree-Width and Optimization in Bounded Degree Graphs
• scientific article; zbMATH DE number 3912430

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cited In (20)

• On the structure and deficiency of \(k\)-trees with bounded degree
• An overview of graph covering and partitioning
• On some degree-and-distance-based graph invariants of trees
• Title not available (Why is that?)
• Large-scale clique cover of real-world networks
• Degree conditions for forests in graphs
• On the complete width and edge clique cover problems
• The 2‐intersection number of paths and bounded‐degree trees
• Known Algorithms for Edge Clique Cover are Probably Optimal
• Title not available (Why is that?)
• On the tree cover number of a graph
• Branch-depth: generalizing tree-depth of graphs
• Treetopes and their Graphs
• Title not available (Why is that?)
• On the kernel size of clique cover reductions for random intersection graphs
• Trees and Co-trees with Bounded Degrees in Planar 3-connected Graphs
• On the tree number of regular graphs
• Title not available (Why is that?)
• Clique Cover and Graph Separation
• Title not available (Why is that?)

This page was built for publication:

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