Dense trees: a new look at degenerate graphs

DOI10.1016/j.jda.2005.12.008zbMath1103.05085OpenAlexW2063493837MaRDI QIDQ849635

Gianni Franceschini, Fabrizio Luccio, Linda Pagli

Publication date: 31 October 2006

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2005.12.008

zbMATH Keywords

decompositionconnectivityspanning treepartial \(k\)-tree\(k\)-degenerate graph\(k\)-dense forest\(k\)-dense tree\(k\)-eliminationinterconnecting structure

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• A partial k-arboretum of graphs with bounded treewidth
• Treewidth. Computations and approximations
• Swapping a failing edge of a single source shortest paths tree is good and fast
• How to survive while visiting a graph
• A Sufficient Condition for Backtrack-Free Search
• An inequality for the chromatic number of a graph
• k-Degenerate Graphs

This page was built for publication: Dense trees: a new look at degenerate graphs