Pages that link to "Item:Q1301726"

The following pages link to A short proof that `proper = unit' (Q1301726):

Displaying 38 items.

• Random generation and enumeration of bipartite permutation graphs (Q414425) (← links)
• Subgraph isomorphism in graph classes (Q456655) (← links)
• On the non-unit count of interval graphs (Q496432) (← links)
• A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs (Q509888) (← links)
• Powers of cycles, powers of paths, and distance graphs (Q531605) (← links)
• Fractional weak discrepancy and split semiorders (Q531608) (← links)
• Canonical antichains of unit interval and bipartite permutation graphs (Q651422) (← links)
• Minimal classes of graphs of unbounded clique-width (Q659655) (← links)
• Mixed unit interval graphs (Q713160) (← links)
• On sum coloring and sum multi-coloring for restricted families of graphs (Q764335) (← links)
• Uniform embeddings for Robinson similarity matrices (Q832894) (← links)
• Combining overlap and containment for gene assembly in ciliates (Q847668) (← links)
• Unit and proper tube orders (Q953272) (← links)
• Some remarks on the geodetic number of a graph (Q965962) (← links)
• Online interval scheduling: Randomized and multiprocessor cases (Q1029703) (← links)
• Extended formulations for order polytopes through network flows (Q1736010) (← links)
• Tractabilities and intractabilities on geometric intersection graphs (Q1736543) (← links)
• Unit interval vertex deletion: fewer vertices are relevant (Q1747495) (← links)
• Declawing a graph: polyhedra and branch-and-cut algorithms (Q2045043) (← links)
• On the maximum cardinality cut problem in proper interval graphs and related graph classes (Q2055967) (← links)
• Unit representation of semiorders. I: Countable sets (Q2244623) (← links)
• Improved randomized online scheduling of intervals and jobs (Q2254495) (← links)
• Sortable simplicial complexes and \(t\)-independence ideals of proper interval graphs (Q2309236) (← links)
• The Roberts characterization of proper and unit interval graphs (Q2461218) (← links)
• A matrix characterization of interval and proper interval graphs (Q2483137) (← links)
• Precoloring extension on unit interval graphs (Q2492199) (← links)
• Shortest reconfiguration of sliding tokens on subclasses of interval graphs (Q2658043) (← links)
• Defensive domination in proper interval graphs (Q2691568) (← links)
• (Q2741323) (← links)
• Short Models for Unit Interval Graphs (Q2840545) (← links)
• (Q2857436) (← links)
• Random Generation and Enumeration of Proper Interval Graphs (Q3605496) (← links)
• Unit Interval Graphs of Open and Closed Intervals (Q4916100) (← links)
• On some subclasses of interval catch digraphs (Q5081214) (← links)
• Quasimonotone graphs (Q5918199) (← links)
• On rectangle intersection graphs with stab number at most two (Q5919053) (← links)
• Toric rings arising from vertex cover ideals (Q6056549) (← links)
• A characterization of unit interval bigraphs of open and closed intervals (Q6184331) (← links)