scientific article
From MaRDI portal
Publication:3347930
zbMath0559.05055MaRDI QIDQ3347930
No author found.
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (86)
Hard-to-color graphs for connected sequential colorings ⋮ Quasi-brittle graphs, a new class of perfectly orderable graphs ⋮ On randomized stopping points and 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 ⋮ The story of perfectly orderable graphs ⋮ Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance ⋮ Induced subgraphs of graphs with large chromatic number. XI. Orientations ⋮ \(P_{4}\)-laden graphs: A new class of brittle graphs ⋮ Coloration de graphes : fondements et applications ⋮ Path parity and perfection ⋮ Generalized neighbourhoods and a class of perfectly orderable graphs ⋮ A new property of critical imperfect graphs and some consequences ⋮ Locally perfect graphs ⋮ Paw-free graphs ⋮ The order-interval hypergraph of a finite poset and the König property ⋮ Characterization and recognition of some opposition and coalition graph classes ⋮ Welsh-Powell opposition graphs ⋮ Weak bipolarizable graphs ⋮ Coloring the cliques of line graphs ⋮ Applications of hypergraph coloring to coloring graphs not inducing certain trees ⋮ On the on-line chromatic number of the family of on-line 3-chromatic graphs ⋮ A note on perfectly orderable graphs ⋮ On the complexity of recognizing a class of perfectly orderable graphs ⋮ Star-cutsets and perfect graphs ⋮ On the closure of graphs under substitution ⋮ \(P_ 4\)-comparability graphs ⋮ Connected sequential colourings ⋮ A note on perfect orders ⋮ Foraging motion of swarms with leaders as Nash equilibria ⋮ Time slot scheduling of compatible jobs ⋮ On the structure of graphs with few \(P_4\)s ⋮ Intersection models and forbidden pattern characterizations for 2-thin and proper 2-thin graphs ⋮ Strongly perfect claw‐free graphs—A short proof ⋮ Online Bounded Coloring of Permutation and Overlap Graphs ⋮ On the isomorphism of graphs with few P4s ⋮ The parallel complexity of elimination ordering procedures ⋮ On domination elimination orderings and domination graphs ⋮ A characterization of \(P_{4}\)-comparability graphs ⋮ Classes of perfect graphs ⋮ Which claw-free graphs are strongly perfect? ⋮ Bipolarizable graphs ⋮ Two optimal strategies for active learning of causal models from interventional data ⋮ A fast parallel algorithm to recognize partitionable graphs ⋮ On the complexity of recognizing perfectly orderable graphs ⋮ Strongly orderable graphs. A common generalization of strongly chordal and chordal bipartite graphs ⋮ On simplicial and co-simplicial vertices in graphs. ⋮ Dominating sets in perfect graphs ⋮ Short-chorded and perfect graphs ⋮ Graphes parfaitement ordonnables généralisés. (Generalized perfectly orderable graphs) ⋮ On the \(P_4\)-components of graphs ⋮ Track assignment ⋮ \(T\)-colorings of graphs: recent results and open problems ⋮ A tree representation for \(P_ 4\)-sparse graphs ⋮ New properties of perfectly orderable graphs and strongly perfect graphs ⋮ Efficient computation of the oriented chromatic number of recursively defined digraphs ⋮ On the structure of bull-free perfect graphs ⋮ Induced colorful trees and paths in large chromatic graphs ⋮ A charming class of perfectly orderable graphs ⋮ Colorful induced subgraphs ⋮ A note on graphs which have upper irredundance equal to independence ⋮ Finding houses and holes in graphs ⋮ An \(O(nm)\)-time certifying algorithm for recognizing HHD-free graphs ⋮ Irredundance ⋮ Recognition of some perfectly orderable graph classes ⋮ Coloring Artemis graphs ⋮ Recognizing brittle graphs: Remarks on a paper of Hoàng and Khouzam ⋮ Properly orderable graphs ⋮ On the complexity of the k-chain subgraph cover problem ⋮ Maximum induced matching problem on hhd-free graphs ⋮ On the semi-perfect elimination ⋮ On probe interval graphs ⋮ On Vertices and Facets of Combinatorial 2-Level Polytopes ⋮ Sequential colorings and perfect graphs ⋮ Acyclic digraphs with Gallai-Milgram-Linial property for clique-covers ⋮ Graph Classes and Forbidden Patterns on Three Vertices ⋮ Tolerance graphs ⋮ A class of strongly perfect graphs ⋮ Graphs with special neighbourhood orderings of vertices ⋮ A class of perfectly contractile graphs ⋮ Weakly triangulated graphs ⋮ Polynomial-time algorithms for minimum weighted colorings of \((P_5, \overline{P}_5)\)-free graphs and similar graph classes ⋮ Clique-transversal sets of line graphs and complements of line graphs ⋮ Decomposition of perfect graphs
This page was built for publication:
