Computing well-covered vector spaces of graphs using modular decomposition (Q6184796): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1007/s40314-023-02502-8 / rank
Normal rank
 
Property / cites work
 
Property / cites work: On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5377222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic graphs and strongly perfect graphs - a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The well-covered dimension of products of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-Covered Vector Spaces of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-covered circulant graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of well-covered graphs with no cycles of length 4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The uniformity space of hypergraphs and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing Greedy Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Structure When All Maximal Independent Sets Have Equal Weight / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast matrix rank algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3139761 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complement reducible graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-covered graphs and extendability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting Weighted Independent Sets beyond the Permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Very well covered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of well covered graphs of girth 5 or greater / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of well‐covered graphs that contain neither 4‐ nor 5‐cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of the algorithmic aspects of modular decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4243055 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Levi graph of point-line configurations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing well covered graphs of families with special \(P _{4}\)-components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted well-covered claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-covered graphs without cycles of lengths 4, 5 and 6 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm to find an independent set of maximum weight in a fork-free graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm to find an independent set of maximum weight in a fork-free graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equistable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular decomposition and transitive orientation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of threshold and domishold graphs: Equistable and equidominating graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some covering concepts in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: WELL-COVERED GRAPHS: A SURVEY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well covered simplicial, chordal, and circular arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4179024 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results for well‐covered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-covered claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of well-covered graphs and the complexity of their recognition problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S40314-023-02502-8 / rank
 
Normal rank

Latest revision as of 19:14, 30 December 2024

scientific article; zbMATH DE number 7784411
Language Label Description Also known as
English
Computing well-covered vector spaces of graphs using modular decomposition
scientific article; zbMATH DE number 7784411

    Statements

    Computing well-covered vector spaces of graphs using modular decomposition (English)
    0 references
    0 references
    0 references
    5 January 2024
    0 references
    weighted well-covered graph
    0 references
    well-covered vector space
    0 references
    modular decomposition
    0 references
    Gaussian elimination
    0 references
    fork-free graph
    0 references
    cograph
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references