Clique-perfectness and balancedness of some graph classes
DOI10.1080/00207160.2014.881994zbMath1303.05072OpenAlexW2005131446MaRDI QIDQ2931952
Guillermo Durán, Martín D. Safe, Flavia Bonomo-Braberman, Annegret K. Wagler
Publication date: 28 November 2014
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2014.881994
recognition algorithmsdiamond-free graphsbalanced graphs\(P_{4}\)-tidy graphsclique-perfect graphspaw-free graphs
Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Perfect graphs (05C17)
Related Items (2)
Cites Work
- Maximum \(h\)-colourable subgraph problem in balanced graphs
- The strong perfect graph theorem
- Algorithms for finding clique-transversals of graphs
- Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs
- Characterizations of strongly chordal graphs
- Coloring perfect \((K_ 4\)-e)-free graphs
- Neighborhood perfect graphs
- Paw-free graphs
- Complement reducible graphs
- On a unique tree representation for \(P_ 4\)-extendible graphs
- Covering the cliques of a graph with vertices
- The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
- Trivially perfect graphs
- Modular decomposition and transitive orientation
- On certain polytopes associated with graphs
- On clique-transversals and clique-independent sets
- The complexity of first-order and monadic second-order logic revisited
- Perfectly colorable graphs
- Algorithmic aspects of clique-transversal and clique-independent sets
- Linear time solvable optimization problems on graphs of bounded clique-width
- Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs
- Distance-hereditary graphs are clique-perfect
- Recognizing Berge graphs
- Algorithms for clique-independent sets on subclasses of circular-arc graphs
- On a property of the class of n-colorable graphs
- A polynomial recognition algorithm for balanced matrices
- On balanced graphs
- Efficient and Practical Algorithms for Sequential Modular Decomposition
- Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs
- A New Class of Brittle Graphs
- 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
- Faster scaling algorithms for general graph matching problems
- Algorithmic Aspects of Neighborhood Numbers
- Paths, Trees, and Flowers
- Transitiv orientierbare Graphen
- Balanced matrices
- The Strong Perfect Graph Conjecture for Planar Graphs
- On minimal forbidden subgraph characterizations of balanced graphs
- Clique-perfectness of complements of line graphs
- Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs
- On minimal forbidden subgraph characterizations of balanced graphs
This page was built for publication: Clique-perfectness and balancedness of some graph classes
