The following pages link to (Q5596083):
Displaying 28 items.
- The minimum number of spanning trees in regular multigraphs (Q2112560) (← links)
- Criterion for a graph to admit a good orientation in terms of leaf blocks (Q2143270) (← links)
- Approximation algorithms for the maximum bounded connected bipartition problem (Q2151359) (← links)
- Counting phylogenetic networks of level 1 and 2 (Q2219260) (← links)
- NP-completeness of st-orientations for plane graphs (Q2268858) (← links)
- Electrical networks and hyperplane arrangements (Q2326914) (← links)
- Bipolar orientations on planar maps and \(\mathrm{SLE}_{12}\) (Q2421815) (← links)
- A graphical calculus for semi-groupal categories (Q2423828) (← links)
- Property testing of planarity in the \textsf{CONGEST} model (Q2657275) (← links)
- Bijective counting of plane bipolar orientations (Q3503485) (← links)
- On Representation of Planar Graphs by Segments (Q3511438) (← links)
- Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs (Q3541081) (← links)
- On Finding Directed Trees with Many Leaves (Q3656853) (← links)
- A direct linear-time planarity test for unflippable modules (Q3804209) (← links)
- (Q5068485) (← links)
- (Q5090386) (← links)
- A dichotomy result for cyclic-order traversing games (Q5091020) (← links)
- Orthogonal drawing of high degree graphs with small area and few bends (Q5096952) (← links)
- Planarity Algorithms via PQ-Trees (Extended Abstract) (Q5300998) (← links)
- Good acyclic orientations of 4‐regular 4‐connected graphs (Q6081883) (← links)
- Planarity for clustered graphs (Q6102302) (← links)
- \(st\)-orientations with few transitive edges (Q6117048) (← links)
- $st$-Orientations with Few Transitive Edges (Q6141787) (← links)
- Output-sensitive reporting of disjoint paths (extended abstract) (Q6142894) (← links)
- An annotated review on graph drawing and its applications (Q6152611) (← links)
- On the construction of planar embedding for a class of orthogonal polyhedra (Q6166832) (← links)
- Visibility representations of toroidal and Klein-bottle graphs (Q6172216) (← links)
- O(n2) algorithms for graph planarization (Q6199475) (← links)