Square-free perfect graphs. (Q1426100): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Created claim: DBLP publication ID (P1635): journals/jct/ConfortiCV04, #quickstatements; #temporary_batch_1732531537061
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2016617305 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star-cutsets and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing Dart-Free Perfect Graphs / 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: A mickey-mouse decomposition theorem / 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: Balanced \(0,\pm 1\) matrices. I: Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced \(0,\pm 1\) matrices. II: Recognition algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of balanced matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theorem of Truemper / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural properties and decomposition of linear balanced matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Articulation sets in linear perfect matrices. I: Forbidden configurations and star cutsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Articulation sets in linear perfect matrices. II: The wheel theorem and clique articulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compositions for perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some properties of minimal imperfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4810376 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the perfect graph conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682511 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a property of the class of n-colorable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alpha-balanced graphs and matrices and GF(3)-representability of matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical perfect graphs and perfect 3-chromatic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring perfect \((K_ 4\)-e)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4869540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4889405 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a class of square-free graphs / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57949594 / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/jct/ConfortiCV04 / rank
 
Normal rank

Latest revision as of 11:47, 25 November 2024

scientific article
Language Label Description Also known as
English
Square-free perfect graphs.
scientific article

    Statements

    Square-free perfect graphs. (English)
    0 references
    0 references
    0 references
    0 references
    14 March 2004
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers