Perfect pairs of trees in graphs

DOI10.1002/CTA.4490200206MaRDI QIDQ3991117zbMATH OpenOpenAlexFDO

Authors Ladislav A. Novak, A. Gibbons

Publication date 28 June 1992

Published in International Journal of Circuit Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/cta.4490200206

zbMATH Keywords

maximally distantperfect pairsubtreestrees

Mathematics Subject Classification ID

Trees (05C05)

Recommendations

• Superperfect pairs of trees in graphs
• Perfect pairs of trees associated with a prescribed tree: An algorithmic approach
• On the distance distribution of trees
• Matchable trees: distance distribution
• Minimal distinct distance trees

Cited in

(8)

• Perfect trees and elementary embeddings
• Perfect pairs of trees associated with a prescribed tree: An algorithmic approach
• scientific article; zbMATH DE number 4127221 (Why is no real title available?)
• scientific article; zbMATH DE number 672342 (Why is no real title available?)
• Double independence and tree pairs in graphs
• Matchable trees: distance distribution
• Note on Perfect Forests in Digraphs
• Superperfect pairs of trees in graphs

This page was built for publication: Perfect pairs of trees in graphs

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