The following pages link to (Q3347930):
Displaying 50 items.
- Characterization and recognition of some opposition and coalition graph classes (Q344867) (← links)
- Induced colorful trees and paths in large chromatic graphs (Q504985) (← links)
- On the structure of bull-free perfect graphs (Q675887) (← links)
- A note on graphs which have upper irredundance equal to independence (Q686250) (← links)
- An \(O(nm)\)-time certifying algorithm for recognizing HHD-free graphs (Q714793) (← links)
- Maximum induced matching problem on hhd-free graphs (Q765362) (← links)
- Tolerance graphs (Q798675) (← links)
- Weakly triangulated graphs (Q801088) (← links)
- Clique-transversal sets of line graphs and complements of line graphs (Q810533) (← links)
- Time slot scheduling of compatible jobs (Q880586) (← 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)
- Coloring Artemis graphs (Q1019741) (← links)
- A class of strongly perfect graphs (Q1060228) (← links)
- Decomposition of perfect graphs (Q1072566) (← links)
- On randomized stopping points and perfect graphs (Q1085176) (← links)
- Alternating orientation and alternating colouration of perfect graphs (Q1089007) (← links)
- Generalized neighbourhoods and a class of perfectly orderable graphs (Q1103648) (← links)
- A new property of critical imperfect graphs and some consequences (Q1104342) (← links)
- Locally perfect graphs (Q1105623) (← links)
- Paw-free graphs (Q1108293) (← links)
- Welsh-Powell opposition graphs (Q1115450) (← links)
- Weak bipolarizable graphs (Q1116961) (← links)
- Star-cutsets and perfect graphs (Q1121289) (← links)
- \(P_ 4\)-comparability graphs (Q1121924) (← links)
- Connected sequential colourings (Q1123198) (← links)
- A note on perfect orders (Q1124614) (← links)
- Dominating sets in perfect graphs (Q1174132) (← links)
- Short-chorded and perfect graphs (Q1174781) (← links)
- Graphes parfaitement ordonnables généralisés. (Generalized perfectly orderable graphs) (Q1175981) (← links)
- \(T\)-colorings of graphs: recent results and open problems (Q1182897) (← links)
- A tree representation for \(P_ 4\)-sparse graphs (Q1183332) (← links)
- New properties of perfectly orderable graphs and strongly perfect graphs (Q1185094) (← links)
- A charming class of perfectly orderable graphs (Q1193431) (← links)
- Colorful induced subgraphs (Q1197025) (← links)
- On the complexity of the k-chain subgraph cover problem (Q1275070) (← links)
- On probe interval graphs (Q1281778) (← links)
- Sequential colorings and perfect graphs (Q1293205) (← links)
- Acyclic digraphs with Gallai-Milgram-Linial property for clique-covers (Q1297441) (← links)
- Graphs with special neighbourhood orderings of vertices (Q1309442) (← links)
- Hard-to-color graphs for connected sequential colorings (Q1329800) (← links)
- Efficient algorithms for minimum weighted colouring of some classes of perfect graphs (Q1339397) (← links)
- Slightly triangulated graphs are perfect (Q1340126) (← links)
- Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance (Q1343143) (← links)
- \(P_{4}\)-laden graphs: A new class of brittle graphs (Q1349998) (← links)
- Path parity and perfection (Q1356748) (← links)
- The order-interval hypergraph of a finite poset and the König property (Q1363653) (← links)
- On the closure of graphs under substitution (Q1377871) (← links)
- Homogeneously orderable graphs (Q1392023) (← links)
