Pages that link to "Item:Q1241524"
From MaRDI portal
The following pages link to The complexity of comparability graph recognition and coloring (Q1241524):
Displaying 46 items.
- Polynomial algorithms for the maximum stable set problem on particular classes of \(P_{5}\)-free graphs (Q290201) (← links)
- The recognition of triangle graphs (Q441856) (← links)
- Adjacency matrices of probe interval graphs (Q608289) (← links)
- A supernodal formulation of vertex colouring with applications in course timetabling (Q610967) (← links)
- Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem (Q653316) (← links)
- On finding a minimum vertex cover of a series-parallel graph (Q758196) (← links)
- Chronological orderings of interval graphs (Q795848) (← links)
- Thinness of product graphs (Q831864) (← links)
- Partitioned probe comparability graphs (Q924151) (← links)
- Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs (Q967378) (← links)
- On the bi-enhancement of chordal-bipartite probe graphs (Q991750) (← links)
- Some results on \((a:b)\)-choosability (Q1025484) (← links)
- Algorithmic aspects of a general modular decomposition theory (Q1026102) (← 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)
- Just-in-time logistics for far-distant suppliers: scheduling truck departures from an intermediate cross-docking terminal (Q1703454) (← links)
- List matrix partitions of graphs representing geometric configurations (Q1741515) (← links)
- On forcibly hereditary P-graphical sequences (Q1820175) (← links)
- The partial gossiping problem (Q1910536) (← links)
- Quasi-threshold graphs (Q1923584) (← links)
- Characterization of \(\mathrm{B}_0\)-VPG cocomparability graphs and a 2D visualization of their posets (Q2088073) (← links)
- Equistable graphs, general partition graphs, triangle graphs, and graph products (Q2275915) (← links)
- Layered graphs: applications and algorithms (Q2287476) (← links)
- On the thinness and proper thinness of a graph (Q2414456) (← links)
- Distance-\(d\) independent set problems for bipartite and chordal graphs (Q2436655) (← links)
- Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs (Q2958319) (← links)
- Approximation Algorithm for the Distance-3 Independent Set Problem on Cubic Graphs (Q2980912) (← links)
- A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation (Q3095042) (← links)
- Lexicographic Orientation Algorithms (Q3120444) (← links)
- Characterization and a 2D Visualization of B$$_{0}$$-VPG Cocomparability Graphs (Q5014117) (← links)
- Outerstring Graphs are $\chi$-Bounded (Q5244121) (← links)
- On \(H\)-topological intersection graphs (Q5925535) (← links)
- Minimum weighted clique cover on claw‐free perfect graphs (Q6055392) (← links)
- Comparability digraphs: an analogue of comparability graphs (Q6177431) (← links)
- Drawing Order Diagrams Through Two-Dimension Extension (Q6181952) (← links)
- Gallai-like characterization of strong cocomparability graphs (Q6595514) (← links)
