The following pages link to (Q3328583):
Displaying 50 items.
- Dominating sets and domatic number of circular arc graphs (Q1066921) (← links)
- Homogeneously representable interval graphs (Q1066922) (← links)
- Clustering and domination in perfect graphs (Q1068110) (← links)
- The struction of a graph: Application to CN-free graphs (Q1068855) (← links)
- \(K_ i\)-covers. I: Complexity and polytopes (Q1070249) (← links)
- Coloring perfect \((K_ 4\)-e)-free graphs (Q1071025) (← links)
- Interval graphs and maps of DNA (Q1071684) (← links)
- Generalized complementation (Q1072574) (← links)
- Intersection graphs of paths in a tree (Q1077439) (← links)
- Two poset polytopes (Q1077721) (← links)
- Circular-arc graphs with clique cover number two (Q1078197) (← links)
- Relaxations of vertex packing (Q1078206) (← links)
- A combinatorial bijection between linear extensions of equivalent orders (Q1078213) (← links)
- Non-interval greedoids and the transposition property (Q1079572) (← links)
- Interval orders without odd crowns are defect optimal (Q1079584) (← links)
- How many atoms can be defined by boxes ? (Q1079815) (← links)
- Cyclic scheduling of offweekends (Q1080361) (← links)
- Hamiltonian threshold graphs (Q1080870) (← links)
- Schedule-induced posets (Q1081529) (← links)
- A note on superbrittle graphs (Q1081614) (← links)
- On an extremal problem concerning the interval number of a graph (Q1084408) (← links)
- On randomized stopping points and perfect graphs (Q1085176) (← links)
- On the computational complexity of the order polynomial (Q1086595) (← links)
- On the complexity of interval orders and semiorders (Q1088407) (← links)
- Biorder families, valued relations, and preference modelling (Q1088611) (← links)
- Enumeration of labelled threshold graphs and a theorem of Frobenius involving Eulerian polynomials (Q1089352) (← links)
- Finding the minimum bandwidth of an interval graph (Q1090458) (← links)
- Hamiltonian circuits in interval graph generalizations (Q1092669) (← links)
- Bipartite permutation graphs (Q1092931) (← links)
- On infinite perfect graphs and randomized stopping points on the plane (Q1093246) (← links)
- A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring (Q1095923) (← links)
- A reduction procedure for coloring perfect \(K_ 4\)-free graphs (Q1096639) (← links)
- Some parallel algorithms on interval graphs (Q1098312) (← links)
- Scheduling jobs with fixed start and end times (Q1098765) (← links)
- On the null-homotopy of bridged graphs (Q1099187) (← links)
- The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs (Q1099628) (← links)
- On domination problems for permutation and other graphs (Q1100915) (← links)
- Packing and covering a tree by subtrees (Q1101129) (← links)
- Recognizing max-flow min-cut path matrices (Q1103514) (← links)
- On embedding graphs in trees (Q1103631) (← links)
- Generalized neighbourhoods and a class of perfectly orderable graphs (Q1103648) (← links)
- Computing the link center of a simple polygon (Q1104086) (← links)
- Unimodularity and circle graphs (Q1104337) (← links)
- Posets with interval upper bound graphs (Q1104348) (← links)
- Adamant digraphs (Q1104933) (← links)
- Multidimensional scaling and threshold graphs (Q1106142) (← links)
- Bridged graphs and geodesic convexity (Q1106237) (← links)
- Intersection graphs of halflines and halfplanes (Q1106247) (← links)
- On the two-phase method for preemptive scheduling (Q1107434) (← links)
- The maximum k-colorable subgraph problem for chordal graphs (Q1108038) (← links)
