The following pages link to (Q5622228):
Displayed 12 items.
- AVDTC numbers of generalized Halin graphs with maximum degree at least 6 (Q925977) (← links)
- Incidence coloring of the squares of some graphs (Q998397) (← links)
- Steiner problem in Halin networks (Q1092013) (← links)
- The binding number of Halin graphs (Q1123910) (← links)
- Dominating cycles in Halin graphs (Q1174137) (← links)
- On Halin subgraphs and supergraphs (Q1343152) (← links)
- A note on the total chromatic number of Halin graphs with maximum degree 4 (Q1808604) (← links)
- On two-connected subgraph polytopes (Q1910503) (← links)
- Computing straight-line 3D grid drawings of graphs in linear volume (Q2387202) (← links)
- On the Steiner 2-edge connected subgraph polytope (Q3598034) (← links)
- On cycle cones and polyhedra (Q5895283) (← links)
- Graph theory (Q5917392) (← links)