Graphs of separability at most 2 (Q415268): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2011.01.016 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1968107207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time algorithms for NP-hard problems restricted to partial k- trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs with polynomially solvable maximum-weight clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4500843 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4425939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3222886 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of bull-free graphs I -- three-edge-paths with centers and anticenters / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Claw-free graphs. IV: Decomposition theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs of Separability at Most Two: Structural Characterizations and Their Consequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs without odd holes, parachutes or proper wheels: A generalization of Meyniel graphs and of line graphs of bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even and odd holes in cap-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mickey-mouse decomposition theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universally signable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even-hole-free graphs part I: Decomposition theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of odd-hole-free graphs by double star cutsets and 2-joins / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theorem of Truemper / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Relationship Between Clique-Width and Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of Graph Grammars and Computing by Graph Transformation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handle-rewriting hypergraph grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time solvable optimization problems on graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On rigid circuit graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4448752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for vertex-partitioning problems on graphs with fixed clique-width. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4063176 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge dominating set and colorings on graphs with fixed clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE CLIQUE–WIDTH OF GRAPH WITH FEW P<sub>4</sub>'S / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorphism of graphs which are pairwise k-separable / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition by clique separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: A structure theorem for graphs with no cycle with a unique chord and its consequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for Generating All the Maximal Independent Sets / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:22, 5 July 2024

scientific article
Language Label Description Also known as
English
Graphs of separability at most 2
scientific article

    Statements

    Graphs of separability at most 2 (English)
    0 references
    0 references
    0 references
    11 May 2012
    0 references
    separability
    0 references
    hereditary class
    0 references
    separating clique
    0 references
    decomposition
    0 references
    induced subgraph
    0 references
    induced minor
    0 references
    parsimony haplotyping
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers