Double independence and tree pairs in graphs

DOI10.1002/(SICI)1097-007X(199611/12)24:6%3C657::AID-CTA946%3E3.0.CO;2-DMaRDI QIDQ4367118zbMATHOpenAlexFDO

Authors Ladislav A. Novak, A. Gibbons

Publication date 29 June 1998

Full work available at URL https://doi.org/10.1002/(sici)1097-007x(199611/12)24:6%3C657::aid-cta946%3E3.0.co;2-d

zbMATH Keywords

circuitcutdouble independent subsets

Mathematics Subject Classification ID

Applications of graph theory (05C90) Trees (05C05) Circuits, networks (94C99) Extremal problems in graph theory (05C35)

Recommendations

• scientific article; zbMATH DE number 733159
• Independent and double domination in trees
• scientific article; zbMATH DE number 4142076
• Double paths
• Perfect pairs of trees in graphs

Cited in

(3)

• Independence numbers of some double vertex graphs and pair graphs
• scientific article; zbMATH DE number 733159 (Why is no real title available?)
• scientific article; zbMATH DE number 1556740 (Why is no real title available?)

This page was built for publication: Double independence and tree pairs in graphs

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