Four classes of perfectly orderable graphs

DOI10.1002/jgt.3190110405zbMath0654.05032OpenAlexW2015769804MaRDI QIDQ3800062

No author found.

Publication date: 1987

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190110405

zbMATH Keywords

threshold graphsDilworth numberperfect ordersMatula perfect graphsWelsh-Powell perfect graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)

Related Items (49)

Bipartable graphs ⋮ A polynomial time algorithm for geodetic hull number for complementary prisms ⋮ On randomized stopping points and perfect graphs ⋮ \(P_{4}\)-laden graphs: A new class of brittle graphs ⋮ On the chromatic index of cographs and join graphs ⋮ On semi-\(P_ 4\)-sparse graphs ⋮ Generalized neighbourhoods and a class of perfectly orderable graphs ⋮ Locally perfect graphs ⋮ On color-critical (\(P_5\),\(\operatorname{co-}P_5\))-free graphs ⋮ Strict 2-threshold graphs ⋮ Welsh-Powell opposition graphs ⋮ Weak bipolarizable graphs ⋮ An nc algorithm to recognize hhd-free graphs ⋮ A note on perfectly orderable graphs ⋮ On the closure of graphs under substitution ⋮ A note on perfect orders ⋮ On the perfect orderability of unions of two graphs ⋮ Contraction Blockers for Graphs with Forbidden Induced Paths ⋮ The cluster deletion problem for cographs ⋮ On the computational complexity of ordered subgraph recognition ⋮ The parallel complexity of elimination ordering procedures ⋮ Bipolarizable graphs ⋮ Maximum weight stable set in (\(P_7\), bull)-free graphs and (\(S_{1, 2, 3}\), bull)-free graphs ⋮ Graphs with No Induced Five‐Vertex Path or Antipath ⋮ A fast parallel algorithm to recognize partitionable graphs ⋮ An optimal greedy heuristic to color interval graphs ⋮ Unnamed Item ⋮ Polynomial cases for the vertex coloring problem ⋮ The smallest hard-to-color graph ⋮ On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem ⋮ A charming class of perfectly orderable graphs ⋮ On the chromatic index of join graphs and triangle-free graphs with large maximum degree ⋮ Which claw-free graphs are perfectly orderable? ⋮ Bipartite bithreshold graphs ⋮ On the Grundy number of graphs with few \(P_4\)'s ⋮ Finding houses and holes in graphs ⋮ Maximum weight independent sets in hole- and dart-free graphs ⋮ Contraction and deletion blockers for perfect graphs and \(H\)-free graphs ⋮ The cd-Coloring of Graphs ⋮ Recognition of some perfectly orderable graph classes ⋮ Recognizing brittle graphs: Remarks on a paper of Hoàng and Khouzam ⋮ An introduction to timetabling ⋮ Maximum induced matching problem on hhd-free graphs ⋮ On the semi-perfect elimination ⋮ A transformation which preserves the clique number ⋮ Graphs with special neighbourhood orderings of vertices ⋮ Polynomial-time algorithms for minimum weighted colorings of \((P_5, \overline{P}_5)\)-free graphs and similar graph classes ⋮ On -sparse graphs and other families ⋮ On the stable set problem in special \(P_{5}\)-free graphs

This page was built for publication: Four classes of perfectly orderable graphs