The following pages link to Chrysanthi N. Raftopoulou (Q300467):
Displaying 23 items.
- Two-page book embeddings of 4-planar graphs (Q300468) (← links)
- (Q1627147) (redirect page) (← links)
- On the queue number of planar graphs (Q2151450) (← links)
- The book thickness of 1-planar graphs is constant (Q2408921) (← links)
- Bounded stub resolution for some maximal 1-planar graphs (Q2636565) (← links)
- Recognizing DAGs with page-number 2 is NP-complete (Q2682927) (← links)
- An improved upper bound on the queue number of planar graphs (Q2684487) (← links)
- On the Density of Non-simple 3-Planar Graphs (Q2961527) (← links)
- Two-Page Book Embeddings of 4-Planar Graphs (Q2965479) (← links)
- On a Conjecture of Lov\'asz on Circle-Representations of Simple 4-Regular Planar Graphs (Q2970413) (← links)
- Vertex-Coloring with Defects (Q2971395) (← links)
- On Optimal 2- and 3-Planar Graphs (Q4580088) (← links)
- Circle-Representations of Simple 4-Regular Planar Graphs (Q4912197) (← links)
- Four pages are indeed necessary for planar graphs (Q5120157) (← links)
- Planar graphs of bounded degree have bounded queue number (Q5212758) (← links)
- Planar Graphs of Bounded Degree Have Bounded Queue Number (Q5235482) (← links)
- Edge partitions of optimal 2-plane and 3-plane graphs (Q5915586) (← links)
- Edge partitions of optimal 2-plane and 3-plane graphs (Q5915955) (← links)
- Book embeddings of nonplanar graphs with small faces in few pages (Q6059964) (← links)
- Book embeddings of \(k\)-framed graphs and \(k\)-map graphs (Q6080147) (← links)
- Testing upward planarity of partial 2-trees (Q6117044) (← links)
- Recognizing DAGs with page-number 2 is NP-complete (Q6117080) (← links)
- Coloring outerplanar graphs and planar 3-trees with small monochromatic components (Q6329821) (← links)