Double independence and tree pairs in graphs

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-007X(199611/12)24:6<657::AID-CTA946>3.0.CO;2-D" /><657::AID-CTA946>3.0.CO;2-D 10.1002/(SICI)1097-007X(199611/12)24:6<657::AID-CTA946>3.0.CO;2-DzbMath0890.05019OpenAlexW2071613281MaRDI QIDQ4367118

Ladislav A. Novak, Alan M. Gibbons

Publication date: 29 June 1998

Full work available at URL: https://doi.org/10.1002/(sici)1097-007x(199611/12)24:6<657::aid-cta946>3.0.co;2-d

zbMATH Keywords

cutcircuitdouble independent subsets

Mathematics Subject Classification ID

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

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