scientific article; zbMATH DE number 1420924

MaRDI QIDQ4944996zbMATH OpenFDO

Authors F. Roussel, Irena Rusu, I. Parfenoff

Publication date 7 August 2000

zbMATH Keywords

Berge graphbreadth-first searchchromatic numbercliqueperfectnesstriangulated graph

Mathematics Subject Classification ID

Perfect graphs (05C17) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Triangulated neighborhoods in even-hole-free graphs
• scientific article; zbMATH DE number 1187256
• Loose vertices in \(C_{4}\)-free Berge graphs
• On the edge-connectivity of C₄-free graphs
• A density bound for triangle‐free 4‐critical graphs
• A note on the maximum size of Berge-\( C_4\)-free hypergraphs
• Fine structure of 4-critical triangle-free graphs. III: General surfaces
• The number of triangles in a \(K_ 4\)-free graph
• scientific article; zbMATH DE number 409491
• scientific article; zbMATH DE number 57426

Cited in

(4)

• Coloring square-free Berge graphs
• Loose vertices in \(C_{4}\)-free Berge graphs
• Bounds on regularity of quadratic monomial ideals
• Triangulated neighborhoods in even-hole-free graphs

This page was built for publication:

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