Pages that link to "Item:Q1241524"
From MaRDI portal
The following pages link to The complexity of comparability graph recognition and coloring (Q1241524):
Displayed 18 items.
- On finding a minimum vertex cover of a series-parallel graph (Q758196) (← links)
- Chronological orderings of interval graphs (Q795848) (← links)
- Partitioned probe comparability graphs (Q924151) (← links)
- On the complexity of a family of generalized matching problems (Q1068535) (← links)
- Bipartite permutation graphs (Q1092931) (← links)
- Planar graphs and poset dimension (Q1121926) (← links)
- An algorithm for generating all maximal independent subsets of posets (Q1147517) (← links)
- Comparability graphs and intersection graphs (Q1172652) (← links)
- Optimal parallel time bounds for the maximum clique problem on intervals (Q1198058) (← links)
- Comparability graphs and a new matroid (Q1235707) (← links)
- Modular decomposition and transitive orientation (Q1301738) (← links)
- Stable sets in certain \(P_6\)-free graphs (Q1304476) (← links)
- On the edge-integrity of some graphs and their complements (Q1313866) (← links)
- On semi-\(P_ 4\)-sparse graphs (Q1356751) (← links)
- Stage-graph representations (Q1363763) (← links)
- On forcibly hereditary P-graphical sequences (Q1820175) (← links)
- The partial gossiping problem (Q1910536) (← links)
- Quasi-threshold graphs (Q1923584) (← links)