Documenti analoghi: Edge-disjoint paths in planar graphs
- On Certain Hamiltonian Cycles in Planar Graphs
- On longest circuits in certain non- regular planar graphs
- On the Shortness Exponent of 1-tough, Maximal Planar Graphs
- More than One Tough Chordal Planar Graphs are Hamiltonian
- Characterizing Edge Betweenness-uniform Graphs
- Disjoint search for the prices of two goods consumend jointly.