The biplanar tree graph
From MaRDI portal
Publication:2210302
Recommendations
Cites work
- A lower bound on the number of spanning trees withk end-vertices
- Comparing Queues and Stacks As Machines for Laying Out Graphs
- Enumeration of noncrossing trees on a circle
- Geometric tree graphs of points in convex position
- scientific article; zbMATH DE number 1109399 (Why is no real title available?)
- Interpolation theorem for diameters of spanning trees
- Laying Out Graphs Using Queues
- Notes on the twisted graph
- On a tree graph defined by a set of cycles
- On the Queue Number of Planar Graphs
- On the tree graph of a connected graph
- Reverse search for enumeration
- Stacks, queues and tracks: layouts of graph subdivisions
- Unavoidable configurations in complete topological graphs
Cited in
(7)- scientific article; zbMATH DE number 1126841 (Why is no real title available?)
- Notes on the twisted graph
- Empty triangles in generalized twisted drawings of \(K_n\)
- Empty Triangles in Generalized Twisted Drawings of $K_n$
- Twisted ways to find plane structures in simple drawings of complete graphs
- Three-bladed billiards
- Partitions of complete twisted graphs into plane spanning trees
This page was built for publication: The biplanar tree graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2210302)