Pages that link to "Item:Q5732670"
From MaRDI portal
The following pages link to A Characterization of Comparability Graphs and of Interval Graphs (Q5732670):
Displaying 50 items.
- An optimal algorithm to recognize Robinsonian dissimilarities (Q269174) (← links)
- Orienting graphs to optimize reachability (Q290248) (← links)
- The recognition of geodetically connected graphs (Q293190) (← links)
- Strictly interval graphs: characterization and linear time recognition (Q325435) (← links)
- A new LBFS-based algorithm for cocomparability graph recognition (Q344849) (← links)
- Two characterisations of the minimal triangulations of permutation graphs (Q390311) (← links)
- An \(\mathcal O(n^2)\)-time algorithm for the minimal interval completion problem (Q391090) (← links)
- Recognition and characterization of chronological interval digraphs (Q396800) (← links)
- Computing feasible toolpaths for 5-axis machines (Q443707) (← links)
- The structure and metric dimension of the power graph of a finite group (Q458587) (← links)
- Representing graphs via pattern avoiding words (Q491554) (← links)
- On the non-unit count of interval graphs (Q496432) (← links)
- Complexity of rainbow vertex connectivity problems for restricted graph classes (Q505435) (← links)
- Strict chordal and strict split digraphs (Q516787) (← links)
- Line-distortion, bandwidth and path-length of a graph (Q521805) (← links)
- Extending partial representations of proper and unit interval graphs (Q524367) (← links)
- Separator orders in interval, cocomparability, and AT-free graphs (Q534331) (← links)
- Convex geometry and group choice (Q585057) (← links)
- Computing the boxicity of a graph by covering its complement by cointerval graphs (Q585228) (← links)
- Proof of Chvátal's conjecture on maximal stable sets and maximal cliques in graphs (Q598473) (← links)
- Adjacency matrices of probe interval graphs (Q608289) (← links)
- Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem (Q653316) (← links)
- A linear-time algorithm for proper interval graph recognition (Q672268) (← links)
- Characterization and complexity of uniformly nonprimitive labeled 2-structures (Q672749) (← links)
- Structure of concurrency (Q685384) (← links)
- Counting endpoint sequences for interval orders and interval graphs (Q685648) (← links)
- On the SPANNING \(k\)-TREE problem (Q686254) (← links)
- Sources in posets and comparability graphs (Q687177) (← links)
- Interval competition graphs of symmetric digraphs (Q688262) (← links)
- Dimensions of hypergraphs (Q757427) (← links)
- Dual parameterization of weighted coloring (Q786042) (← links)
- Synthesizing partial orders given comparability information: Partitive sets and slack in critical path networks (Q793664) (← links)
- Almost all comparability graphs are UPO (Q795847) (← links)
- Chronological orderings of interval graphs (Q795848) (← links)
- The relationship between the threshold dimension of split graphs and various dimensional parameters (Q803177) (← links)
- Parameterized dominating set problem in chordal graphs: Complexity and lower bound (Q839675) (← links)
- Combining overlap and containment for gene assembly in ciliates (Q847668) (← links)
- Tree loop graphs (Q876466) (← links)
- Recognizing graphs without asteroidal triples (Q876727) (← links)
- Further hardness results on rainbow and strong rainbow connectivity (Q908308) (← links)
- An evolution of interval graphs (Q912869) (← links)
- On the complexity of recognizing perfectly orderable graphs (Q918707) (← links)
- An optimal greedy heuristic to color interval graphs (Q922724) (← links)
- Rooted directed path graphs are leaf powers (Q965972) (← links)
- Dimension-2 poset competition numbers and dimension-2 poset double competition numbers (Q968201) (← links)
- Proof of Ding's conjecture on maximal stable sets and maximal cliques in planar graphs (Q993683) (← links)
- Recognizing edge clique graphs among interval graphs and probe interval graphs (Q998556) (← links)
- Minimal interval completion through graph exploration (Q1001896) (← links)
- The neighbour-scattering number can be computed in polynomial time for interval graphs (Q1005803) (← links)
- A linear time recognition algorithm for proper interval graphs (Q1014413) (← links)
