Pages that link to "Item:Q2502033"
From MaRDI portal
The following pages link to Planar graphs, via well-orderly maps and trees (Q2502033):
Displaying 26 items.
- Nested hierarchies in planar graphs (Q411860) (← links)
- Degree distribution in random planar graphs (Q549258) (← links)
- Schnyder woods for higher genus triangulated surfaces, with applications to encoding (Q834610) (← links)
- Random graphs on surfaces (Q933680) (← links)
- Quick encoding of plane graphs in \(\log _{2}14\) bits per edge (Q975433) (← links)
- Pachinko (Q1699294) (← links)
- Short encodings of planar graphs and maps (Q1805444) (← links)
- The space complexity of sum labelling (Q2140502) (← links)
- Lower bounds for protrusion replacement by counting equivalence classes (Q2174552) (← links)
- Schnyder decompositions for regular plane graphs and application to drawing (Q2429329) (← links)
- Bounding the number of reduced trees, cographs, and series-parallel graphs by compression (Q2846474) (← links)
- Uniform random sampling of planar graphs in linear time (Q3055787) (← links)
- Asymptotic enumeration and limit laws of planar graphs (Q3079198) (← links)
- Topological classification of polynomial complex differential equations with all the critical points of centre type (Q3570118) (← links)
- An Information-Theoretic Upper Bound on Planar Graphs Using Well-Orderly Maps (Q4900004) (← links)
- Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds (Q5130572) (← links)
- The Parameterized Complexity of Finding a 2-Sphere in a Simplicial Complex (Q5241237) (← links)
- A Census of Plane Graphs with Polyline Edges (Q5267999) (← links)
- (Q5699440) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5710808) (← links)
- Classes of graphs embeddable in order-dependent surfaces (Q5886263) (← links)
- Fast and compact planar embeddings (Q5918983) (← links)
- The space complexity of sum labelling (Q6056630) (← links)
- Statistics of Feynman amplitudes in \(\phi^4\)-theory (Q6142751) (← links)
- Efficient enumeration of drawings and combinatorial structures for maximal planar graphs (Q6575407) (← links)
- First-order sentences in random groups. I: Universal sentences (Q6629505) (← links)