scientific article; zbMATH DE number 3891425
From MaRDI portal
Publication:3347930
Recommendations
Cited in
(97)- A class of perfectly contractile graphs
- A characterization of \(P_{4}\)-comparability graphs
- Two optimal strategies for active learning of causal models from interventional data
- scientific article; zbMATH DE number 15461 (Why is no real title available?)
- On the on-line chromatic number of the family of on-line 3-chromatic graphs
- On domination elimination orderings and domination graphs
- Properly orderable graphs
- New properties of perfectly orderable graphs and strongly perfect graphs
- Polynomial-time algorithms for minimum weighted colorings of \((P_5, \overline{P}_5)\)-free graphs and similar graph classes
- Path parity and perfection
- The parallel complexity of elimination ordering procedures
- \(P_ 4\)-comparability graphs
- Locally perfect graphs
- Decomposition of perfect graphs
- The order-interval hypergraph of a finite poset and the König property
- A new property of critical imperfect graphs and some consequences
- Tolerance graphs
- Graphes parfaitement ordonnables généralisés. (Generalized perfectly orderable graphs)
- Online Bounded Coloring of Permutation and Overlap Graphs
- Coloring the cliques of line graphs
- Perfectly orderable graphs and unique colorability
- On probe interval graphs
- Efficient computation of the oriented chromatic number of recursively defined digraphs
- An \(O(nm)\)-time certifying algorithm for recognizing HHD-free graphs
- On the complexity of the k-chain subgraph cover problem
- Strongly perfect claw‐free graphs—A short proof
- Graph classes and forbidden patterns on three vertices
- A note on perfectly orderable graphs
- On the semi-perfect elimination
- Solving NP-hard problems on \textsc{GaTEx} graphs: linear-time algorithms for perfect orderings, cliques, colorings, and independent sets
- On simplicial and co-simplicial vertices in graphs.
- A note on perfect orders
- A note on graphs which have upper irredundance equal to independence
- Linear time algorithms for NP-hard problems restricted to \textsc{GaTEx} graphs
- Finding houses and holes in graphs
- Efficient algorithms for minimum weighted colouring of some classes of perfect graphs
- Strongly orderable graphs. A common generalization of strongly chordal and chordal bipartite graphs
- Sequential colorings and perfect graphs
- Induced subgraphs of graphs with large chromatic number. XI. Orientations
- Maximum induced matching problem on hhd-free graphs
- \(T\)-colorings of graphs: recent results and open problems
- Weak bipolarizable graphs
- Weakly triangulated graphs
- Quasi-brittle graphs, a new class of perfectly orderable graphs
- Foraging motion of swarms with leaders as Nash equilibria
- Acyclic digraphs with Gallai-Milgram-Linial property for clique-covers
- Homogeneously orderable graphs
- Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance
- Intersection models and forbidden pattern characterizations for 2-thin and proper 2-thin graphs
- Dominating sets in perfect graphs
- A tree representation for \(P_ 4\)-sparse graphs
- Graphs with special neighbourhood orderings of vertices
- Paw-free graphs
- The story of perfectly orderable graphs
- Coloring Artemis graphs
- Time slot scheduling of compatible jobs
- A charming class of perfectly orderable graphs
- Which line-graphs are perfectly orderable?
- Which claw-free graphs are strongly perfect?
- Applications of hypergraph coloring to coloring graphs not inducing certain trees
- Classes of perfect graphs
- Short-chorded and perfect graphs
- Characterization and recognition of some opposition and coalition graph classes
- scientific article; zbMATH DE number 3851153 (Why is no real title available?)
- \(P_{4}\)-laden graphs: A new class of brittle graphs
- Slightly triangulated graphs are perfect
- Track assignment
- A note on strong perfectness of graphs
- On the closure of graphs under substitution
- On the structure of graphs with few P₄s
- A fast parallel algorithm to recognize partitionable graphs
- Clique-transversal sets of line graphs and complements of line graphs
- Connected sequential colourings
- Recognizing brittle graphs: Remarks on a paper of Hoàng and Khouzam
- A class of strongly perfect graphs
- Bipolarizable graphs
- On the complexity of recognizing perfectly orderable graphs
- On the structure of bull-free perfect graphs
- Induced colorful trees and paths in large chromatic graphs
- Hard-to-color graphs for connected sequential colorings
- Irredundance
- All variations on perfectly orderable graphs
- Welsh-Powell opposition graphs
- Star-cutsets and perfect graphs
- Successive vertex orderings of fully regular graphs
- On the \(P_4\)-components of graphs
- Colorful induced subgraphs
- Alternating orientation and alternating colouration of perfect graphs
- On the isomorphism of graphs with few P4s
- Recognition of some perfectly orderable graph classes
- On randomized stopping points and perfect graphs
- Thinness and its variations on some graph families and coloring graphs of bounded thinness
- Describing hereditary properties by forbidden circular orderings
- Generalized neighbourhoods and a class of perfectly orderable graphs
- LexBFS-orderings and powers of graphs
- Coloration de graphes : fondements et applications
- On the complexity of recognizing a class of perfectly orderable graphs
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 Q3347930)
