On tree roots of graphs

DOI10.1080/00207169908804886MaRDI QIDQ4944671zbMATH OpenOpenAlexWikidataFDO

Authors

Publication date 21 August 2000

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207169908804886

zbMATH Keywords

clique spanpower of a graphpower of a treeroots of graphs

Mathematics Subject Classification ID

Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Algorithms for Square Roots of Graphs
• Linear-time algorithms for tree root problems
• Large-girth roots of graphs
• Linear-Time Algorithms for Tree Root Problems
• Tree Powers

Cited in

(16)

• Branchings in rooted graphs and the diameter of greedoids
• Root vertex valency distributions of rooted maps and rooted triangulations
• Maximum modulus of independence roots of graphs and trees
• Branch-depth: generalizing tree-depth of graphs
• Rooted tree maps
• Linear-time algorithms for tree root problems
• scientific article; zbMATH DE number 1617253 (Why is no real title available?)
• Problems related to graph indices in trees
• Rooted induced trees in triangle-free graphs
• Structure Polynomials and Subgraphs of Rooted Regular Trees
• Iterated joining of rooted trees
• Tree Powers
• Treetopes and their Graphs
• Tree robustness of a graph
• Algorithms for Square Roots of Graphs
• Linear-Time Algorithms for Tree Root Problems

This page was built for publication: On tree roots of graphs

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