The following pages link to Aurora Morgana (Q918990):
Displaying 34 items.
- (Q749551) (redirect page) (← links)
- Long cycles in graphs with large degree sums (Q749553) (← links)
- Degree sequences of matrogenic graphs (Q797597) (← links)
- General theoretical results on rectilinear embeddability of graphs (Q809088) (← links)
- A simple proof of a theorem of Jung (Q918991) (← links)
- The graph sandwich problem for \(P_4\)-sparse graphs (Q1025565) (← links)
- Structure and recognition of domishold graphs (Q1087562) (← links)
- Adamant digraphs (Q1104933) (← links)
- On the complexity of recognizing tough graphs (Q1313820) (← links)
- Single bend wiring on surfaces (Q1348375) (← links)
- On-line 2-satisfiability (Q1356216) (← links)
- A graph partition problem (Q1367109) (← links)
- The complexity of recognizing tough cubic graphs (Q1372728) (← links)
- A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid (Q1382254) (← links)
- Path equipartition in the Chebyshev norm (Q1569949) (← links)
- Polynomial algorithms that prove an NP-hard hypothesis implies an NP-hard conclusion (Q1613360) (← links)
- The clique operator on cographs and serial graphs (Q1827743) (← links)
- An algorithm for 1-bend embeddings of plane graphs in the two-dimensional grid (Q1827866) (← links)
- Tutte sets in graphs. II: The complexity of finding maximum Tutte sets (Q2370435) (← links)
- Recognizing well covered graphs of families with special \(P _{4}\)-components (Q2376085) (← links)
- The clique operator on graphs with few \(P_{4}\)'s (Q2489945) (← links)
- (Q2741461) (← links)
- (Q2804810) (← links)
- (Q2918485) (← links)
- (Q3197328) (← links)
- The P4-sparse Graph Sandwich Problem (Q3439332) (← links)
- Edge Coloring of Split Graphs (Q3503526) (← links)
- Tutte sets in graphs I: Maximal tutte sets and D-graphs (Q3594956) (← links)
- (Q3624957) (← links)
- (Q4211748) (← links)
- (Q4489197) (← links)
- (Q4810366) (← links)
- (Q4894957) (← links)
- A tribute to Célia P. de Mello (Q6496807) (← links)
