Matching cutsets in graphs of diameter 2 (Q955037): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2008.07.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1997541985 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On stable cutsets in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Size in maximal triangle-free graphs and minimal graphs of diameter 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs of diameter two with no 4-circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable set bonding in perfect graphs and parity graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4954442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient and Practical Algorithms for Sequential Modular Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient conditions for \(\lambda'\)-optimality in graphs of diameter 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal and minimal vertex-critical graphs of diameter two / rank
 
Normal rank
Property / cites work
 
Property / cites work: On stable cutsets in line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128916 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular decomposition and transitive orientation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching cutsets in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring graphs with stable cutsets / rank
 
Normal rank

Latest revision as of 20:33, 28 June 2024

scientific article
Language Label Description Also known as
English
Matching cutsets in graphs of diameter 2
scientific article

    Statements

    Matching cutsets in graphs of diameter 2 (English)
    0 references
    18 November 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    matching cutset
    0 references
    stable cutset
    0 references
    graph algorithms
    0 references
    0 references