Some classes of perfectly orderable graphs
From MaRDI portal
Publication:3831058
Recommendations
Cited in
(56)- A finiteness theorem for primal extensions
- A characterization of \(P_{4}\)-comparability graphs
- New classes of perfectly orderable graphs
- scientific article; zbMATH DE number 15461 (Why is no real title available?)
- Perfectly orderable graphs are quasi-parity graphs: a short proof
- GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH
- Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory
- Properly orderable graphs
- Simplicial vertices in graphs with no induced four-edge path or four-edge antipath, and the \(H_{6}\)-conjecture
- On the perfect orderability of unions of two graphs
- On opposition graphs, coalition graphs, and bipartite permutation graphs
- \(P_ 4\)-comparability graphs
- scientific article; zbMATH DE number 846971 (Why is no real title available?)
- Minimal asymmetric graphs
- On variations of \(P_{4}\)-sparse graphs
- Recognizing quasi-triangulated graphs.
- On P₅-free locally split graphs
- scientific article; zbMATH DE number 15158 (Why is no real title available?)
- Perfectly orderable graphs: A survey
- Four classes of perfectly orderable graphs
- On the semi-perfect elimination
- Finding houses and holes in graphs
- Structure and stability number of chair-, co-P- and gem-free graphs revisited
- On the structure of (\(P_{5}\),\,gem)-free graphs
- Even and odd pairs in comparability and in P₄-comparability graphs
- Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly
- Extension of hereditary classes with substitutions
- Path-bicolorable graphs. (Extended abstract)
- Homogeneously orderable graphs
- Weighted independent sets in a subclass of P₆-free graphs
- Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time.
- Independent domination in finitely defined classes of graphs
- Perfect graphs
- On the structure and stability number of \(P_{5}\)- and co-chair-free graphs
- (\(P_{5}\), diamond)-free graphs revisited: Structure and linear time optimization.
- On minimal prime extensions of a four-vertex graph in a prime graph
- Which line-graphs are perfectly orderable?
- All minimal prime extensions of hereditary classes of graphs
- scientific article; zbMATH DE number 3891425 (Why is no real title available?)
- Characterization and recognition of some opposition and coalition graph classes
- Maximum independent sets in subclasses of \(P_{5}\)-free graphs
- \(P_{4}\)-laden graphs: A new class of brittle graphs
- Which claw-free graphs are perfectly orderable?
- On the complexity of recognizing perfectly orderable graphs
- Oracles for vertex elimination orderings
- All variations on perfectly orderable graphs
- 1-perfectly orientable \(K_4\)-minor-free and outerplanar graphs
- Path-bicolorable graphs
- Bichromatic \(P_{4}\)-composition schemes for perfect orderability
- On the \(P_4\)-components of graphs
- On graphs with limited number of \(P_{4}\)-partners
- scientific article; zbMATH DE number 4045795 (Why is no real title available?)
- Alternating orientation and alternating colouration of perfect graphs
- Recognition of some perfectly orderable graph classes
- Generalized neighbourhoods and a class of perfectly orderable graphs
- On the complexity of recognizing a class of perfectly orderable graphs
This page was built for publication: Some classes of perfectly orderable graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3831058)
