On tree roots of graphs

DOI10.1080/00207169908804886zbMATH Open0942.05016OpenAlexW2158908115WikidataQ126246080 ScholiaQ126246080MaRDI QIDQ4944671FDOQ4944671

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

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

zbMATH Keywords

power of a graphpower of a treeclique spanroots of graphs

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (14)

• Rooted induced trees in triangle-free graphs
• Linear-time algorithms for tree root problems
• Problems related to graph indices in trees
• Rooted tree maps
• Maximum modulus of independence roots of graphs and trees
• Tree robustness of a graph
• Branchings in rooted graphs and the diameter of greedoids
• Structure Polynomials and Subgraphs of Rooted Regular Trees
• Root vertex valency distributions of rooted maps and rooted triangulations
• Branch-depth: generalizing tree-depth of graphs
• Treetopes and their Graphs
• Title not available (Why is that?)
• Iterated joining of rooted trees
• 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)