Pages that link to "Item:Q3800062"
From MaRDI portal
The following pages link to Four classes of perfectly orderable graphs (Q3800062):
Displaying 50 items.
- On the chromatic index of cographs and join graphs (Q324879) (← links)
- On color-critical (\(P_5\),\(\operatorname{co-}P_5\))-free graphs (Q344847) (← links)
- The cluster deletion problem for cographs (Q394219) (← links)
- Polynomial cases for the vertex coloring problem (Q666663) (← links)
- Meyniel weakly triangulated graphs. I: Co-perfect orderability (Q678852) (← links)
- Which claw-free graphs are perfectly orderable? (Q686245) (← links)
- Bipartite bithreshold graphs (Q688258) (← links)
- Maximum weight independent sets in hole- and dart-free graphs (Q714022) (← links)
- An introduction to timetabling (Q759645) (← links)
- Maximum induced matching problem on hhd-free graphs (Q765362) (← links)
- Bipolarizable graphs (Q912868) (← links)
- A fast parallel algorithm to recognize partitionable graphs (Q917295) (← links)
- On the complexity of recognizing perfectly orderable graphs (Q918707) (← links)
- An optimal greedy heuristic to color interval graphs (Q922724) (← links)
- Bipartable graphs (Q1080439) (← links)
- On randomized stopping points and perfect graphs (Q1085176) (← links)
- Generalized neighbourhoods and a class of perfectly orderable graphs (Q1103648) (← links)
- Locally perfect graphs (Q1105623) (← links)
- Strict 2-threshold graphs (Q1111574) (← links)
- All variations on perfectly orderable graphs (Q1114703) (← links)
- Welsh-Powell opposition graphs (Q1115450) (← links)
- Weak bipolarizable graphs (Q1116961) (← links)
- \(P_ 4\)-comparability graphs (Q1121924) (← links)
- A note on perfect orders (Q1124614) (← links)
- The smallest hard-to-color graph (Q1185079) (← links)
- New properties of perfectly orderable graphs and strongly perfect graphs (Q1185094) (← links)
- A charming class of perfectly orderable graphs (Q1193431) (← links)
- Sequential colorings and perfect graphs (Q1293205) (← links)
- Graphs with special neighbourhood orderings of vertices (Q1309442) (← links)
- \(P_{4}\)-laden graphs: A new class of brittle graphs (Q1349998) (← links)
- On semi-\(P_ 4\)-sparse graphs (Q1356751) (← links)
- On the closure of graphs under substitution (Q1377871) (← links)
- Maximum weight stable set in (\(P_7\), bull)-free graphs and (\(S_{1, 2, 3}\), bull)-free graphs (Q1709548) (← links)
- On the chromatic index of join graphs and triangle-free graphs with large maximum degree (Q1752497) (← links)
- On the Grundy number of graphs with few \(P_4\)'s (Q1759824) (← links)
- Contraction and deletion blockers for perfect graphs and \(H\)-free graphs (Q1784743) (← links)
- Recognition of some perfectly orderable graph classes (Q1811119) (← links)
- Recognizing brittle graphs: Remarks on a paper of Hoàng and Khouzam (Q1814095) (← links)
- Properly orderable graphs (Q1815322) (← links)
- On the semi-perfect elimination (Q1825204) (← links)
- A transformation which preserves the clique number (Q1850572) (← links)
- On the stable set problem in special \(P_{5}\)-free graphs (Q1861559) (← links)
- A note on perfectly orderable graphs (Q1917281) (← links)
- Perfectly colorable graphs (Q1944175) (← links)
- Polynomial-time algorithms for minimum weighted colorings of \((P_5, \overline{P}_5)\)-free graphs and similar graph classes (Q2345603) (← links)
- Classes of graphs with minimum skew rank 4 (Q2435566) (← links)
- On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem (Q2465646) (← links)
- Perfectly orderable \(P_4\) composition (Q2741505) (← links)
- Perfectly orderable graphs: A survey (Q2758336) (← links)
- The cd-Coloring of Graphs (Q2795960) (← links)
