Some classes of perfectly orderable graphs
From MaRDI portal
Publication:3831058
DOI10.1002/jgt.3190130407zbMath0676.05071OpenAlexW4240804599MaRDI QIDQ3831058
Publication date: 1989
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190130407
Related Items
\(P_{4}\)-laden graphs: A new class of brittle graphs, Characterization and recognition of some opposition and coalition graph classes, All minimal prime extensions of hereditary classes of graphs, On the complexity of recognizing a class of perfectly orderable graphs, \(P_ 4\)-comparability graphs, Minimal asymmetric graphs, Independent domination in finitely defined classes of graphs, On variations of \(P_{4}\)-sparse graphs, Weighted independent sets in a subclass of \(P_6\)-free graphs, A characterization of \(P_{4}\)-comparability graphs, On the structure and stability number of \(P_{5}\)- and co-chair-free graphs, On opposition graphs, coalition graphs, and bipartite permutation graphs, (\(P_{5}\), diamond)-free graphs revisited: Structure and linear time optimization., Recognizing quasi-triangulated graphs., Path-bicolorable graphs, On the \(P_4\)-components of graphs, GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH, Which claw-free graphs are perfectly orderable?, A finiteness theorem for primal extensions, On the structure of (\(P_{5}\),\,gem)-free graphs, On minimal prime extensions of a four-vertex graph in a prime graph, Maximum independent sets in subclasses of \(P_{5}\)-free graphs, Finding houses and holes in graphs, Structure and stability number of chair-, co-P- and gem-free graphs revisited, Recognition of some perfectly orderable graph classes, Extension of hereditary classes with substitutions, Even and odd pairs in comparability and in \(P_4\)-comparability graphs, Bichromatic \(P_{4}\)-composition schemes for perfect orderability, Path-Bicolorable Graphs, Simplicial Vertices in Graphs with no Induced Four-Edge Path or Four-Edge Antipath, and theH6-Conjecture, Oracles for vertex elimination orderings, ON GRAPHS WITH LIMITED NUMBER OF P4-PARTNERS, Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time.
Cites Work
