scientific article
From MaRDI portal
Publication:3682511
zbMath0567.05034MaRDI QIDQ3682511
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
New classes of perfect graphs, Slightly triangulated graphs are perfect, Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance, Path parity and perfection, A fast algorithm for coloring Meyniel graphs, A corrected version of the Duchet kernel conjecture, Resolving prime modules: the structure of pseudo-cographs and galled-tree explainable graphs, Perfect graphs, kernels, and cores of cooperative games, Classes of perfect graphs, Kempe equivalence of colourings of cubic graphs, Square-free perfect graphs., Dominating sets in perfect graphs, Short-chorded and perfect graphs, Recognition of quasi-Meyniel graphs, Precoloring extension of co-Meyniel graphs, Kempe equivalence of colourings of cubic graphs, Minimax relations for the partial q-colorings of a graph, The strong perfect graph conjecture: 40 years of attempts, and its resolution, Perfectly contractile graphs, Coloring Meyniel graphs in linear time, Colouring Some Classes of Perfect Graphs Robustly
