Generating subgraphs in chordal graphs

DOI10.1016/J.DAM.2025.02.042MaRDI QIDQ6995818zbMATH OpenFDO

Authors Vadim E. Levit, David Tankus

Publication date 17 April 2025

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2025.02.042

zbMATH Keywords

chordal graphgenerating subgraphmaximal independent setrelating edgeweighted well-covered graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Analysis of algorithms and problem complexity (68Q25)

Cites work

• A characterization of well covered graphs of girth 5 or greater
• A characterization of well‐covered graphs that contain neither 4‐ nor 5‐cycles
• Complexity results for generating subgraphs
• Complexity results for well‐covered graphs
• Computing well-covered vector spaces of graphs using modular decomposition
• scientific article; zbMATH DE number 434906 (Why is no real title available?)
• scientific article; zbMATH DE number 3513839 (Why is no real title available?)
• scientific article; zbMATH DE number 3614795 (Why is no real title available?)
• scientific article; zbMATH DE number 3322854 (Why is no real title available?)
• Local Structure When All Maximal Independent Sets Have Equal Weight
• Modeling k-coteries by well-covered graphs
• On relating edges in graphs without cycles of length 4
• Recognizing generating subgraphs in graphs without cycles of lengths 6 and 7
• Recognizing generating subgraphs revisited
• Recognizing Greedy Structures
• Some covering concepts in graphs
• The structure of well-covered graphs and the complexity of their recognition problems
• The structure of well-covered graphs with no cycles of length 4
• Weighted well-covered graphs without \(C_{4}, C_{5}, C_{6}, C_{7}\)
• Weighted well-covered graphs without cycles of lengths 5, 6 and 7
• Well covered simplicial, chordal, and circular arc graphs
• Well-covered claw-free graphs
• Well-covered graphs and extendability
• Well-covered graphs without cycles of lengths 4, 5 and 6
• Well-Covered Vector Spaces of Graphs

Cited in

(1)

• Optimization of layout for embedding complete k-partite graphs into line graphs of certain tree architectures

This page was built for publication: Generating subgraphs in chordal graphs

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