Simultaneous embedding of colored graphs

DOI10.1007/s00373-021-02276-yOpenAlexW3121302458MaRDI QIDQ2045370

Debajyoti Mondal

Publication date: 12 August 2021

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2101.06596

zbMATH Keywords

thicknessgraph drawingsimultaneous embeddingbend complexitymonotonic sequence

Mathematics Subject Classification ID

Graph theory (05Cxx) Computing methodologies and applications (68Uxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Colored simultaneous geometric embeddings and universal pointsets
• Curve-constrained drawings of planar graphs
• Universal sets of \(n\) points for one-bend drawings of planar graphs with \(n\) vertices
• On simultaneous planar graph embeddings
• SIMULTANEOUS EMBEDDING OF OUTERPLANAR GRAPHS, PATHS, AND CYCLES
• Relating Graph Thickness to Planar Layers and Bend Complexity
• Colored Point-Set Embeddings of Acyclic Graphs
• Simultaneous Embedding of Planar Graphs with Few Bends
• k-colored Point-set Embeddability of Outerplanar Graphs
• Embedding planar graphs at fixed vertex locations

This page was built for publication: Simultaneous embedding of colored graphs