Superperfect pairs of trees in graphs

DOI10.1002/CTA.4490210207zbMATH Open0777.05044OpenAlexW4248059029MaRDI QIDQ5285745FDOQ5285745

Authors Ladislav A. Novak, A. Gibbons

Publication date 29 June 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.4490210207

zbMATH Keywords

algorithmcutsetsmaximally distant pairssuperperfect pair of trees

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Perfect pairs of trees in graphs
• scientific article; zbMATH DE number 672342
• Tree- and forest-perfect graphs
• Matchings in superpositions of (n, n)‐bipartite trees
• scientific article; zbMATH DE number 2170472
• On trees with perfect matchings
• Perfect pairs of trees associated with a prescribed tree: An algorithmic approach
• Pure pairs. IV: Trees in bipartite graphs
• On superperfect noncomparability graphs

Cited in

(3)

• Perfect pairs of trees associated with a prescribed tree: An algorithmic approach
• scientific article; zbMATH DE number 672342 (Why is no real title available?)
• Perfect pairs of trees in graphs

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

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