Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths (Q3195131): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1406.6494 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new bijection between ordered trees and legal bracketings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3428669 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On balanced graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimal forbidden subgraph characterizations of balanced graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-perfectness and balancedness of some graph classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of balanced matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of balanced and perfect matrices / 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: Testing balancedness and perfection of linear matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dyck path enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133404 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic aspects of clique-transversal and clique-independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-hereditary graphs are clique-perfect / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighborhood perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4288086 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering all cliques of a graph / rank
 
Normal rank

Latest revision as of 22:19, 10 July 2024

scientific article
Language Label Description Also known as
English
Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths
scientific article

    Statements

    Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths (English)
    0 references
    0 references
    0 references
    21 October 2015
    0 references
    balanced/perfect graph
    0 references
    balanced/perfect matrices
    0 references

    Identifiers

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