Publication:3222875

From MaRDI portal


zbMath0558.05037MaRDI QIDQ3222875

Pierre Duchet, Claude Berge

Publication date: 1984



05C35: Extremal problems in graph theory

05C65: Hypergraphs

05C38: Paths and cycles

05C40: Connectivity


Related Items

Research problems, A note on graphs which have upper irredundance equal to independence, Weakly triangulated graphs, Perfectly contractile graphs, Orientations of graphs in kernel theory, Clique-transversal sets of line graphs and complements of line 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, On sources in comparability graphs, with applications, 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, On kernels in i-triangulated graphs, The structure of imperfect critically strongly-imperfect graphs, Stable effectivity functions and perfect graphs, Classes of perfect graphs, Which claw-free graphs are strongly perfect?, Bithreshold Graphs, A note on strong perfectness of graphs, Unnamed Item