Perfect pairs of trees associated with a prescribed tree: An algorithmic approach

DOI10.1002/CTA.4490200606MaRDI QIDQ4036066zbMATH OpenOpenAlexFDO

Authors Ladislav A. Novak, A. Gibbons

Publication date 16 May 1993

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.4490200606

zbMATH Keywords

spanning treesperfect pair of trees

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Structural characterization of families of graphs (05C75)

Recommendations

• Perfect pairs of trees in graphs
• On trees with perfect matchings
• scientific article; zbMATH DE number 672342
• Superperfect pairs of trees in graphs
• Ordering trees with nearly perfect matchings by algebraic connectivity
• Pairs of trees in tree--tree triangulations
• Paired-domination of trees
• An efficient algorithm for some tree matching problems
• Trees with large paired-domination number
• Counting the number of perfect matchings, and generalized decision trees

Cited in

(4)

• Two short proofs of the Perfect Forest Theorem
• Perfect pairs of trees in graphs
• scientific article; zbMATH DE number 672342 (Why is no real title available?)
• Superperfect pairs of trees in graphs

This page was built for publication: Perfect pairs of trees associated with a prescribed tree: An algorithmic approach

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