Pages that link to "Item:Q3013145"

The following pages link to Re-embeddings of Maximum 1-Planar Graphs (Q3013145):

Displaying 45 items.

• A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system (Q391976) (← links)
• Proper 1-immersions of graphs triangulating the plane (Q394202) (← links)
• A linear-time algorithm for testing outer-1-planarity (Q494794) (← links)
• On partitioning the edges of 1-plane graphs (Q501676) (← links)
• Ortho-polygon visibility representations of embedded graphs (Q724238) (← links)
• Relationship among triangulations, quadrangulations and optimal 1-planar graphs (Q897254) (← links)
• New results on edge partitions of 1-plane graphs (Q1694686) (← links)
• Recognizing optimal 1-planar graphs in linear time (Q1702117) (← links)
• \(\mathsf{T}\)-shape visibility representations of 1-planar graphs (Q1702255) (← links)
• Characterizing and recognizing 4-map graphs (Q1741846) (← links)
• The matching extendability of optimal 1-planar graphs (Q1756050) (← links)
• Light subgraphs in the family of 1-planar graphs with high minimum degree (Q1757981) (← links)
• Embedding-preserving rectangle visibility representations of nonplanar graphs (Q1991089) (← links)
• Planar graphs having no proper 2-immersions in the plane. I (Q2037555) (← links)
• Non-1-planarity of lexicographic products of graphs (Q2042623) (← links)
• Counting cliques in 1-planar graphs (Q2111191) (← links)
• The density of fan-planar graphs (Q2121760) (← links)
• Recognizing and embedding simple optimal 2-planar graphs (Q2151433) (← links)
• On quasi-planar graphs: clique-width and logical description (Q2174559) (← links)
• Re-embedding a 1-plane graph for a straight-line drawing in linear time (Q2235768) (← links)
• Fan-planarity: properties and complexity (Q2346379) (← links)
• \(K_7\)-minors in optimal 1-planar graphs (Q2400554) (← links)
• On RAC drawings of 1-planar graphs (Q2402260) (← links)
• An annotated bibliography on 1-planarity (Q2407041) (← links)
• \(\mathsf{NIC}\)-planar graphs (Q2410219) (← links)
• Fan-crossing free graphs and their relationship to other beyond-planar graphs (Q2663047) (← links)
• Cyclic 4-Colorings of Graphs on Surfaces (Q3188662) (← links)
• Contact Representations of Graphs in 3D (Q3449802) (← links)
• 1-Planar Graphs (Q5001656) (← links)
• Algorithms for 1-Planar Graphs (Q5001657) (← links)
• $$\textit{\textbf{k}}$$-Planar Graphs (Q5001659) (← links)
• The Stub Resolution of 1-planar Graphs (Q5084699) (← links)
• (Q5091019) (← links)
• Generating polyhedral quadrangulations of the projective plane (Q5217067) (← links)
• EVERY OUTER-1-PLANE GRAPH HAS A RIGHT ANGLE CROSSING DRAWING (Q5300010) (← links)
• All 2-planar graphs having the same spanning subgraph (Q6087085) (← links)
• On the edge-connectivity and restricted edge-connectivity of optimal 1-planar graphs (Q6090829) (← links)
• The family of fan-planar graphs (Q6091140) (← links)
• Maximal 1-plane graphs with dominating vertices (Q6096305) (← links)
• The maximum matching extendability and factor-criticality of 1-planar graphs (Q6110614) (← links)
• Optimal 1-planar multigraphs (Q6172296) (← links)
• (Q6179340) (← links)
• On restricted matching extension of 1-embeddable graphs in surfaces with small genus (Q6589143) (← links)
• Cops and robbers on 1-planar graphs (Q6618244) (← links)
• Re-1-embeddings of optimal 1-embedded graphs on the projective plane (Q6648289) (← links)