scientific article; zbMATH DE number 637286

MaRDI QIDQ4304338zbMATH OpenFDO

Authors Lutz Volkmann, Bert Randerath

Publication date 26 January 1995

zbMATH Keywords

4-cycles5-cyclesblockblock graphblock-cactus graphcliquesimplexwell covered graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Recommendations

• scientific article; zbMATH DE number 4202288
• A characterization of well‐covered graphs that contain neither 4‐ nor 5‐cycles
• Well covered simplicial, chordal, and circular arc graphs
• Publication:4940016

Cited in

(15)

• Well-covered and Cohen-Macaulay theta-ring graphs
• Unmixedness of some weighted oriented graphs
• On the complexity of the vector connectivity problem
• Pure vertex decomposable simplicial complex associated to graphs whose 5-cycles are chorded
• Well-covered graphs and factors
• On \(\alpha\)-excellent graphs
• scientific article; zbMATH DE number 4202288 (Why is no real title available?)
• Tree-like structure graphs with full diversity of balls
• Regularity and projective dimension of some class of well-covered graphs
• scientific article; zbMATH DE number 7471093 (Why is no real title available?)
• Enumeration of labeled block-cactus graphs
• Finding cut-vertices in the square roots of a graph
• Recognizing well-dominated graphs is coNP-complete
• Prime graphs, matchings and the Castelnuovo-Mumford regularity
• On one approach to enumeration of labeled connected graphs: a review

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 Q4304338)