Computing well-covered vector spaces of graphs using modular decomposition
DOI10.1007/s40314-023-02502-8arXiv2212.08599OpenAlexW4388895640MaRDI QIDQ6184796
Publication date: 5 January 2024
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2212.08599
Gaussian eliminationmodular decompositioncographweighted well-covered graphfork-free graphwell-covered vector space
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vector spaces, linear dependence, rank, lineability (15A03) Signed and weighted graphs (05C22)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A survey of the algorithmic aspects of modular decomposition
- The well-covered dimension of products of graphs
- Weighted well-covered claw-free graphs
- On the Levi graph of point-line configurations
- Well-covered circulant graphs
- A class of threshold and domishold graphs: Equistable and equidominating graphs
- Stochastic graphs and strongly perfect graphs - a survey
- Complement reducible graphs
- A characterization of well covered graphs of girth 5 or greater
- The uniformity space of hypergraphs and its applications
- Modular decomposition and transitive orientation
- Well-covered graphs and extendability
- The structure of well-covered graphs and the complexity of their recognition problems
- On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph
- Very well covered graphs
- Well-covered claw-free graphs
- Well-covered graphs without cycles of lengths 4, 5 and 6
- Recognizing well covered graphs of families with special \(P _{4}\)-components
- The structure of well-covered graphs with no cycles of length 4
- Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
- Complexity results for well‐covered graphs
- Local Structure When All Maximal Independent Sets Have Equal Weight
- Graph Classes: A Survey
- WELL-COVERED GRAPHS: A SURVEY
- Equistable graphs
- A characterization of well‐covered graphs that contain neither 4‐ nor 5‐cycles
- Recognizing Greedy Structures
- Well covered simplicial, chordal, and circular arc graphs
- Counting Weighted Independent Sets beyond the Permanent
- Reducibility among Combinatorial Problems
- Fast matrix rank algorithms and applications
- Well-Covered Vector Spaces of Graphs
- Some covering concepts in graphs
- A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
- A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
This page was built for publication: Computing well-covered vector spaces of graphs using modular decomposition
