scientific article
From MaRDI portal
Publication:3222875
zbMath0558.05037MaRDI QIDQ3222875
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Paths and cycles (05C38) Connectivity (05C40)
Related Items (56)
Bithreshold Graphs ⋮ A note on superbrittle graphs ⋮ New classes of perfect graphs ⋮ Efficient algorithms for minimum weighted colouring of some classes of perfect graphs ⋮ Slightly triangulated graphs are perfect ⋮ Alternating orientation and alternating colouration of perfect graphs ⋮ A note on strong perfectness of graphs ⋮ Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance ⋮ Even and odd pairs in linegraphs of bipartite graphs ⋮ On a conjecture of Meyniel ⋮ Super strongly perfect graphs ⋮ Strong perfectness of the generalized Cartesian product of graphs ⋮ Path parity and perfection ⋮ A new property of critical imperfect graphs and some consequences ⋮ Locally perfect graphs ⋮ Paw-free graphs ⋮ A fast algorithm for coloring Meyniel graphs ⋮ Coloring the cliques of line graphs ⋮ New examples of minimal non-strongly-perfect graphs ⋮ The strongly perfectness of normal product of \(t\)-perfect graphs ⋮ Star-cutsets and perfect graphs ⋮ Slim graphs ⋮ A note on perfect orders ⋮ Perfect graphs are kernel solvable ⋮ The structure of imperfect critically strongly-imperfect graphs ⋮ Structure of super strongly perfect graphs ⋮ Strongly perfect claw‐free graphs—A short proof ⋮ 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 ⋮ Strong cliques in vertex‐transitive graphs ⋮ Coloring vertices of a graph or finding a Meyniel obstruction ⋮ Classes of perfect graphs ⋮ Which claw-free graphs are strongly perfect? ⋮ Graphs vertex-partitionable into strong cliques ⋮ Meyniel graphs are strongly perfect ⋮ The sheaf-theoretic structure of non-locality and contextuality ⋮ 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) ⋮ Classes of graphs with low complexity: the case of classes with bounded linear rankwidth ⋮ Stable effectivity functions and perfect graphs ⋮ Sum-perfect graphs ⋮ New properties of perfectly orderable graphs and strongly perfect graphs ⋮ A note on graphs which have upper irredundance equal to independence ⋮ On sources in comparability graphs, with applications ⋮ Research problems ⋮ Irredundance ⋮ Strongly perfect products of graphs ⋮ Detecting strong cliques ⋮ On kernels in i-triangulated graphs ⋮ A class of strongly perfect graphs ⋮ 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:
