The following pages link to (Q3875975):
Displayed 17 items.
- Recognizing hidden bicircular networks (Q1208462) (← links)
- Computing an st-numbering (Q1231771) (← links)
- Cliques that are tolerance digraphs (Q1382269) (← links)
- The composition of semi-finished inventories at a solid board plant. (Q1428051) (← links)
- Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs (Q1827836) (← links)
- MPQ-trees for the orthogonal packing problem (Q1935724) (← links)
- Steiner tree in \(k\)-star caterpillar convex bipartite graphs: a dichotomy (Q2165280) (← links)
- Explicit Boij-Söderberg theory of ideals from a graph isomorphism reduction (Q2184790) (← links)
- Coloring temporal graphs (Q2237899) (← links)
- All-shortest-path 2-interval routing is NP-complete (Q2380872) (← links)
- On the complexity of the black-and-white coloring problem on some classes of perfect graphs (Q2445872) (← links)
- A convexity upper bound for the number of maximal bicliques of a bipartite graph (Q2448895) (← links)
- Hamiltonicity of regular graphs and blocks of consecutive ones in symmetric matrices (Q2457012) (← links)
- On the hardness of minimizing space for all-shortest-path interval routing schemes (Q2465642) (← links)
- MPQ-trees for orthogonal packing problem (Q2883589) (← links)
- An Optimal Algorithm for Strict Circular Seriation (Q5018899) (← links)
- Proximity Search for Maximal Subgraph Enumeration (Q5048293) (← links)