scientific article; zbMATH DE number 434700
From MaRDI portal
Publication:3139539
Recommendations
Cited in
(36)- On edges crossing few other edges in simple topological complete graphs
- On fan-crossing and fan-crossing free graphs
- Characterizing and recognizing 4-map graphs
- The crossing number of twisted graphs
- Simple realizability of complete abstract topological graphs simplified
- On fan-crossing graphs
- Characterizing 5-map graphs by 2-fan-crossing graphs
- Weighted Turán problems with applications
- Fan-crossing free graphs and their relationship to other beyond-planar graphs
- Drawing of a graph on a surface
- The number of crossings in a regular drawing of the complete bipartite graph
- scientific article; zbMATH DE number 3898914 (Why is no real title available?)
- scientific article; zbMATH DE number 3914340 (Why is no real title available?)
- Improved enumeration of simple topological graphs
- A note on the cross-index of a complete graph based on a linear tree
- scientific article; zbMATH DE number 840686 (Why is no real title available?)
- Notes on the twisted graph
- Convex drawings of the complete graph: topology meets geometry
- Graph Drawing
- scientific article; zbMATH DE number 4198021 (Why is no real title available?)
- The Complexity of Several Realizability Problems for Abstract Topological Graphs
- scientific article; zbMATH DE number 4185631 (Why is no real title available?)
- Enumeration of simple complete topological graphs
- Enumeration of simple complete topological graphs
- Unavoidable patterns in complete simple topological graphs
- Twisted ways to find plane structures in simple drawings of complete graphs
- Monochromatic spanning trees and matchings in ordered complete graphs
- Towards crossing-free Hamiltonian cycles in simple drawings of complete graphs
- Simple realizability of complete abstract topological graphs in P
- Unavoidable patterns in complete simple topological graphs
- Partitions of complete twisted graphs into plane spanning trees
- Disjoint faces in drawings of the complete graph and topological Heilbronn problems
- A note on maximal plane subgraphs of the complete twisted graph containing perfect matchings
- Holes in convex and simple drawings
- Separable drawings: extendability and crossing-free Hamiltonian cycles
- How many ways can one draw a graph?
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3139539)
