scientific article; zbMATH DE number 3889565
From MaRDI portal
Publication:3222875
[For the entire collection see Zbl 0546.00006.] The paper investigates the class of graphs containing a set of vertices which meets exactly once every maximal clique. It gives characterization of strongly perfect graphs. In particular, it is shown that every strongly perfect graph is perfect.
Recommendations
Cited in
(70)- Triangle-free strongly circular-perfect graphs
- A class of strongly perfect graphs
- A note on superbrittle graphs
- New classes of perfect graphs
- Alternating orientation and alternating colouration of perfect graphs
- On a conjecture of Meyniel
- A new property of critical imperfect graphs and some consequences
- Locally perfect graphs
- Paw-free graphs
- A fast algorithm for coloring Meyniel graphs
- Star-cutsets and perfect graphs
- Slim graphs
- A note on perfect orders
- Perfect graphs are kernel solvable
- Meyniel graphs are strongly perfect
- Dominating sets in perfect graphs
- Short-chorded and perfect graphs
- Some aspects of the semi-perfect elimination
- Graphes parfaitement ordonnables généralisés. (Generalized perfectly orderable graphs)
- New properties of perfectly orderable graphs and strongly perfect graphs
- Articulation sets in linear perfect matrices. II: The wheel theorem and clique articulations
- On sources in comparability graphs, with applications
- Some classes of strongly perfect graphs
- Efficient algorithms for minimum weighted colouring of some classes of perfect graphs
- Slightly triangulated graphs are perfect
- Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance
- Even and odd pairs in linegraphs of bipartite graphs
- Strong perfectness of the generalized Cartesian product of graphs
- Path parity and perfection
- The strongly perfectness of normal product of \(t\)-perfect graphs
- Essentially perfect and essentially diperfect graphs
- Graphs vertex-partitionable into strong cliques
- Sum-perfect graphs
- On kernels in i-triangulated graphs
- Strongly perfect infinite graphs
- The structure of imperfect critically strongly-imperfect graphs
- Stable effectivity functions and perfect graphs
- Classes of graphs with low complexity: the case of classes with bounded linear rankwidth
- Detecting strong cliques
- Coloring the cliques of line graphs
- Classes of perfect graphs
- Which claw-free graphs are strongly perfect?
- New examples of minimal non-strongly-perfect graphs
- A class of weakly perfect graphs
- scientific article; zbMATH DE number 4179414 (Why is no real title available?)
- scientific article; zbMATH DE number 3884201 (Why is no real title available?)
- Irredundance
- Bithreshold Graphs
- scientific article; zbMATH DE number 3926973 (Why is no real title available?)
- A note on strong perfectness of graphs
- scientific article; zbMATH DE number 4041969 (Why is no real title available?)
- Strongly perfect products of graphs
- Claw-free graphs with strongly perfect complements. Fractional and integral version. I: Basic graphs
- Claw-free graphs with strongly perfect complements. Fractional and integral version. II: Nontrivial strip-structures
- Coloring vertices of a graph or finding a Meyniel obstruction
- scientific article; zbMATH DE number 846971 (Why is no real title available?)
- A new characterization of trivially perfect graphs
- Super strongly perfect graphs
- Structure of super strongly perfect graphs
- The sheaf-theoretic structure of non-locality and contextuality
- Research problems
- Strongly perfect claw‐free graphs—A short proof
- Strong cliques in vertex‐transitive graphs
- A note on graphs which have upper irredundance equal to independence
- The regularity and unimodality of h-polynomial of corona graphs
- A note on the multicolour version of the Erdős-Hajnal conjecture
- Weakly triangulated graphs
- Perfectly contractile graphs
- Orientations of graphs in kernel theory
- Clique-transversal sets of line graphs and complements of line graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3222875)