Pages that link to "Item:Q4285595"
From MaRDI portal
The following pages link to Two trees in maximal planar bipartite graphs (Q4285595):
Displaying 12 items.
- Hamiltonicity and generalised total colourings of planar graphs (Q274671) (← links)
- 4-labelings and grid embeddings of plane quadrangulations (Q418877) (← links)
- On the tree number of regular graphs (Q1356782) (← links)
- Tree-decompositions of graphs. I (Q1370176) (← links)
- A note on the tree decompositions of graphs (Q1387426) (← links)
- Minimum degree and minimum number of edge-disjoint trees (Q1420598) (← links)
- Applications of matroid partition to tree decomposition (Q1568255) (← links)
- Tree decompositions for a class of graphs (Q1584355) (← links)
- A left-first search algorithm for planar graphs (Q1892422) (← links)
- The degree/diameter problem in maximal planar bipartite graphs (Q5890615) (← links)
- Tree decomposition (Q5955927) (← links)
- The degree/diameter problem in maximal planar bipartite graphs (Q5965484) (← links)