Clique-perfectness and balancedness of some graph classes (Q2931952): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Flavia Bonomo-Braberman / rank
 
Normal rank
Property / author
 
Property / author: Annegret K. Wagler / rank
 
Normal rank
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.1080/00207160.2014.881994 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2005131446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On balanced graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial characterizations of clique-perfect graphs I: Subclasses of claw-free 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: Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs / 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: Clique-perfectness of complements of line 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 r-Domination and Clique r-Packing Problems on Dually Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Algorithm for the Decomposition of Graphs and Posets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Aspects of Neighborhood Numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing Berge graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On certain polytopes associated with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complement reducible graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Recognition Algorithm for Cographs / 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: Maximum \(h\)-colourable subgraph problem in balanced 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: On clique-transversals and clique-independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for clique-independent sets on subclasses of circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for finding clique-transversals of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering the cliques of a graph with vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of strongly chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of first-order and monadic second-order logic revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster scaling algorithms for general graph matching problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitiv orientierbare Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trivially perfect graphs / 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: A New Class of Brittle Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a unique tree representation for \(P_ 4\)-extendible graphs / 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: Modular decomposition and transitive orientation / 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: Perfectly colorable 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: A New Algorithm for Generating All the Maximal Independent Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Strong Perfect Graph Conjecture for Planar 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: A polynomial recognition algorithm for balanced matrices / rank
 
Normal rank

Latest revision as of 09:34, 9 July 2024

scientific article
Language Label Description Also known as
English
Clique-perfectness and balancedness of some graph classes
scientific article

    Statements

    Clique-perfectness and balancedness of some graph classes (English)
    0 references
    0 references
    0 references
    0 references
    28 November 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    balanced graphs
    0 references
    clique-perfect graphs
    0 references
    diamond-free graphs
    0 references
    \(P_{4}\)-tidy graphs
    0 references
    paw-free graphs
    0 references
    recognition algorithms
    0 references
    0 references
    0 references
    0 references
    0 references