Four classes of perfectly orderable graphs
From MaRDI portal
Recommendations
Cited in
(68)- Bipartable graphs
- On randomized stopping points and perfect graphs
- Generalized neighbourhoods and a class of perfectly orderable graphs
- Locally perfect graphs
- Strict 2-threshold graphs
- All variations on perfectly orderable graphs
- Welsh-Powell opposition graphs
- Weak bipolarizable graphs
- \(P_ 4\)-comparability graphs
- A note on perfect orders
- The smallest hard-to-color graph
- New properties of perfectly orderable graphs and strongly perfect graphs
- A charming class of perfectly orderable graphs
- Graphs with special neighbourhood orderings of vertices
- \(P_{4}\)-laden graphs: A new class of brittle graphs
- On semi-\(P_ 4\)-sparse graphs
- On the closure of graphs under substitution
- Maximum weight stable set in (\(P_7\), bull)-free graphs and (\(S_{1, 2, 3}\), bull)-free graphs
- On the chromatic index of join graphs and triangle-free graphs with large maximum degree
- On the Grundy number of graphs with few P₄'s
- Contraction and deletion blockers for perfect graphs and \(H\)-free graphs
- Recognition of some perfectly orderable graph classes
- Recognizing brittle graphs: Remarks on a paper of Hoàng and Khouzam
- Properly orderable graphs
- On the semi-perfect elimination
- A transformation which preserves the clique number
- On the stable set problem in special \(P_{5}\)-free graphs
- A note on perfectly orderable graphs
- Perfectly colorable graphs
- Polynomial-time algorithms for minimum weighted colorings of \((P_5, \overline{P}_5)\)-free graphs and similar graph classes
- Classes of graphs with minimum skew rank 4
- On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem
- Perfectly orderable P₄ composition
- Perfectly orderable graphs: A survey
- The cd-coloring of graphs
- Contraction Blockers for Graphs with Forbidden Induced Paths
- scientific article; zbMATH DE number 6700502 (Why is no real title available?)
- Graphs with No Induced Five‐Vertex Path or Antipath
- Hardly perfect graphs
- On the chromatic index of cographs and join graphs
- On -sparse graphs and other families
- On color-critical (\(P_5\),\(\operatorname{co-}P_5\))-free graphs
- Some classes of perfectly orderable graphs
- The cluster deletion problem for cographs
- A simple nc recognition algorithm for welsh-powell opposition graphs
- An nc algorithm to recognize hhd-free graphs
- scientific article; zbMATH DE number 1251573 (Why is no real title available?)
- On the computational complexity of ordered subgraph recognition
- scientific article; zbMATH DE number 817188 (Why is no real title available?)
- Perfect and locally perfect colorings
- A generalization of simplicial elimination orderings
- On the perfect orderability of unions of two graphs
- A polynomial time algorithm for geodetic hull number for complementary prisms
- Finding houses and holes in graphs
- New classes of perfectly orderable graphs
- The parallel complexity of elimination ordering procedures
- Solving the list coloring problem through a branch-and-price algorithm
- Polynomial cases for the vertex coloring problem
- Meyniel weakly triangulated graphs. I: Co-perfect orderability
- Which claw-free graphs are perfectly orderable?
- Bipartite bithreshold graphs
- Maximum weight independent sets in hole- and dart-free graphs
- An introduction to timetabling
- Maximum induced matching problem on hhd-free graphs
- Bipolarizable graphs
- A fast parallel algorithm to recognize partitionable graphs
- On the complexity of recognizing perfectly orderable graphs
- An optimal greedy heuristic to color interval graphs
This page was built for publication: Four classes of perfectly orderable graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3800062)
