scientific article; zbMATH DE number 3889565
From MaRDI portal
Publication:3222875
zbMATH Open0558.05037MaRDI QIDQ3222875FDOQ3222875
Authors: Pierre Duchet, C. Berge 
Publication date: 1984
Title of this publication is not available (Why is that?)
Recommendations
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Connectivity (05C40) Hypergraphs (05C65)
Cited In (66)
- Title not available (Why is that?)
- Strongly perfect infinite graphs
- New examples of minimal non-strongly-perfect graphs
- The structure of imperfect critically strongly-imperfect graphs
- Irredundance
- Super strongly perfect graphs
- Structure of super strongly perfect graphs
- New classes of perfect graphs
- Triangle-free strongly circular-perfect graphs
- Title not available (Why is that?)
- New properties of perfectly orderable graphs and strongly perfect 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
- Title not available (Why is that?)
- Path parity and perfection
- Some aspects of the semi-perfect elimination
- A class of weakly perfect graphs
- Title not available (Why is that?)
- Locally perfect graphs
- Articulation sets in linear perfect matrices. II: The wheel theorem and clique articulations
- Perfect graphs are kernel solvable
- Coloring vertices of a graph or finding a Meyniel obstruction
- Detecting strong cliques
- A new property of critical imperfect graphs and some consequences
- Coloring the cliques of line graphs
- Graphes parfaitement ordonnables généralisés. (Generalized perfectly orderable graphs)
- Strongly perfect claw‐free graphs—A short proof
- Strong cliques in vertex‐transitive graphs
- A note on perfect orders
- On kernels in i-triangulated graphs
- A note on graphs which have upper irredundance equal to independence
- Efficient algorithms for minimum weighted colouring of some classes of perfect graphs
- On a conjecture of Meyniel
- A fast algorithm for coloring Meyniel graphs
- Bithreshold Graphs
- Weakly triangulated graphs
- Even and odd pairs in linegraphs of bipartite graphs
- Stable effectivity functions and perfect graphs
- The sheaf-theoretic structure of non-locality and contextuality
- Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance
- Dominating sets in perfect graphs
- Sum-perfect graphs
- Paw-free graphs
- A new characterization of trivially perfect graphs
- Which claw-free graphs are strongly perfect?
- Classes of perfect graphs
- Perfectly contractile graphs
- Short-chorded and perfect graphs
- Graphs vertex-partitionable into strong cliques
- A note on strong perfectness of graphs
- Strongly perfect products of graphs
- Slightly triangulated graphs are perfect
- A note on superbrittle graphs
- Clique-transversal sets of line graphs and complements of line graphs
- A class of strongly perfect graphs
- Classes of graphs with low complexity: the case of classes with bounded linear rankwidth
- Strong perfectness of the generalized Cartesian product of graphs
- Star-cutsets and perfect graphs
- Slim graphs
- On sources in comparability graphs, with applications
- Orientations of graphs in kernel theory
- The strongly perfectness of normal product of \(t\)-perfect graphs
- Research problems
- Alternating orientation and alternating colouration of perfect graphs
- Meyniel graphs are strongly perfect
- Title not available (Why is that?)
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)
