Clique-perfectness and balancedness of some graph classes
From MaRDI portal
Publication:2931952
Recommendations
- Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs
- Clique-perfectness of complements of line graphs
- On clique-transversals and clique-independent sets
- Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs
- Clique-perfectness of claw-free planar graphs
Cites work
- A Fast Algorithm for the Decomposition of Graphs and Posets
- A Linear Recognition Algorithm for Cographs
- A New Algorithm for Generating All the Maximal Independent Sets
- A New Class of Brittle Graphs
- A polynomial recognition algorithm for balanced matrices
- Algorithmic Aspects of Neighborhood Numbers
- Algorithmic aspects of clique-transversal and clique-independent sets
- Algorithms for clique-independent sets on subclasses of circular-arc graphs
- Algorithms for finding clique-transversals of graphs
- Balanced matrices
- Characterizations of strongly chordal graphs
- Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs
- Clique-perfectness of complements of line graphs
- Coloring perfect \((K_ 4\)-e)-free graphs
- Complement reducible graphs
- Covering the cliques of a graph with vertices
- Distance-hereditary graphs are clique-perfect
- Efficient and practical algorithms for sequential modular decomposition
- Faster scaling algorithms for general graph matching problems
- Linear time solvable optimization problems on graphs of bounded clique-width
- Maximum \(h\)-colourable subgraph problem in balanced graphs
- Modular decomposition and transitive orientation
- Neighborhood perfect graphs
- On a property of the class of n-colorable graphs
- On a unique tree representation for \(P_ 4\)-extendible graphs
- On balanced graphs
- On certain polytopes associated with graphs
- On clique-transversals and clique-independent sets
- On minimal forbidden subgraph characterizations of balanced graphs
- On minimal forbidden subgraph characterizations of balanced graphs
- Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs
- Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs
- Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs
- Paths, Trees, and Flowers
- Paw-free graphs
- Perfectly colorable graphs
- Recognizing Berge graphs
- The Strong Perfect Graph Conjecture for Planar Graphs
- The complexity of first-order and monadic second-order logic revisited
- The strong perfect graph theorem
- The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
- Transitiv orientierbare Graphen
- Trivially perfect graphs
Cited in
(6)- Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths
- Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs
- Characterization of classical graph classes by weighted clique graphs
- Recognition algorithm for \(P_4\)-tidy graphs
- On some graph classes related to perfect graphs: a survey
- Clique-perfectness of complements of line graphs
This page was built for publication: Clique-perfectness and balancedness of some graph classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2931952)
