Generating weakly triangulated graphs

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199601)21:1<67::AID-JGT9>3.0.CO;2-K" /><67::AID-JGT9>3.0.CO;2-K 10.1002/(SICI)1097-0118(199601)21:1<67::AID-JGT9>3.0.CO;2-KzbMath0837.05075OpenAlexW2055167479MaRDI QIDQ4862110

No author found.

Publication date: 23 April 1996

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199601)21:1<67::aid-jgt9>3.0.co;2-k

zbMATH Keywords

chordless cycleweakly triangulated graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75)

Related Items (5)

A vertex incremental approach for maintaining chordality ⋮ Star-cutsets and perfect graphs ⋮ A magnetic procedure for the stability number ⋮ Avoidable vertices and edges in graphs: existence, characterization, and applications ⋮ A separator-based method for generating weakly chordal graphs

This page was built for publication: Generating weakly triangulated graphs