Generating weakly triangulated graphs

DOI10.1002/(SICI)1097-0118(199601)21:1%3C67::AID-JGT9%3E3.0.CO;2-KMaRDI QIDQ4862110zbMATH OpenOpenAlexFDO

Authors

Publication date 23 April 1996

Full work available at URL https://doi.org/10.1002/(sici)1097-0118(199601)21:1%3C67::aid-jgt9%3E3.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)

Recommendations

• Weakly triangulated graphs
• Generating weakly chordal graphs from arbitrary graphs
• Algorithms for weakly triangulated graphs
• On generating triangle-free graphs
• Optimizing weakly triangulated graphs
• Generating all triangulations of plane graphs
• Weakly Triangulated Comparability Graphs
• Generation of various classes of trivalent graphs
• The generation of maximal triangle-free graphs
• Generating \(r\)-regular graphs

Cited in

(10)

• Star-cutsets and perfect graphs
• Meyniel weakly triangulated graphs. II: A theorem of Dirac
• Avoidable vertices and edges in graphs: existence, characterization, and applications
• A separator-based method for generating weakly chordal graphs
• Generating weakly chordal graphs from arbitrary graphs
• Verification of a certificate for weakly chordal graphs
• Projective dimension of weakly chordal graphic arrangements
• Weakly triangulated graphs
• A vertex incremental approach for maintaining chordality
• A magnetic procedure for the stability number

This page was built for publication: Generating weakly triangulated graphs

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