Pages that link to "Item:Q2461218"
From MaRDI portal
The following pages link to The Roberts characterization of proper and unit interval graphs (Q2461218):
Displaying 31 items.
- Unit and single point interval graphs (Q427904) (← links)
- On the non-unit count of interval graphs (Q496432) (← links)
- Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded (Q512562) (← links)
- A structural characterization for certifying Robinsonian matrices (Q529005) (← links)
- Powers of cycles, powers of paths, and distance graphs (Q531605) (← links)
- The \(t\)-discrepancy of a poset (Q602757) (← links)
- On sum coloring and sum multi-coloring for restricted families of graphs (Q764335) (← links)
- Uniform embeddings for Robinson similarity matrices (Q832894) (← links)
- Koszul binomial edge ideals of pairs of graphs (Q1794075) (← links)
- Normal Helly circular-arc graphs and its subclasses (Q1949109) (← links)
- Graphs of interval count two with a given partition (Q2015148) (← links)
- On the \(e\)-positivity of \((claw, 2K_2)\)-free graphs (Q2034064) (← links)
- \(\mathcal{U}\)-bubble model for mixed unit interval graphs and its applications: the MaxCut problem revisited (Q2067672) (← links)
- Conflict-free coloring: graphs of bounded clique width and intersection graphs (Q2115843) (← links)
- Hamiltonian paths, unit-interval complexes, and determinantal facet ideals (Q2168562) (← links)
- Perfect elimination orderings for symmetric matrices (Q2174877) (← links)
- Sortable simplicial complexes and \(t\)-independence ideals of proper interval graphs (Q2309236) (← links)
- Classes of graphs with \(e\)-positive chromatic symmetric function (Q2325752) (← links)
- New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs (Q2330102) (← links)
- Linear embeddings of graphs and graph limits (Q2347848) (← links)
- Short Models for Unit Interval Graphs (Q2840545) (← links)
- Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. Chapter I: theory (Q2985115) (← links)
- On partitioning interval graphs into proper interval subgraphs and related problems (Q3174235) (← links)
- Circularly Compatible Ones, $D$-Circularity, and Proper Circular-Arc Bigraphs (Q4986807) (← links)
- (Q5089227) (← links)
- Toric rings arising from vertex cover ideals (Q6056549) (← links)
- Geometric stabbing via threshold rounding and factor revealing LPs (Q6124825) (← links)
- A horizontal-strip LLT polynomial is determined by its weighted graph (Q6204692) (← links)
- Conflict-free coloring: graphs of bounded clique-width and intersection graphs (Q6582374) (← links)
- Graphs with at most two moplexes (Q6595515) (← links)
- Exactly hittable interval graphs (Q6599815) (← links)
