On the Shortness Exponent of 1-tough, Maximal Planar Graphs
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Capítulo de libro |
| Lenguaje: | inglés |
| Etiquetas: |
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares: On the Shortness Exponent of 1-tough, Maximal Planar Graphs
- More than One Tough Chordal Planar Graphs are Hamiltonian
- On longest circuits in certain non- regular planar graphs
- Edge-disjoint paths in planar graphs
- On Certain Hamiltonian Cycles in Planar Graphs
- 5-regular 3-polytopal graphs with edges of only two types and shortness exponents less than one
- On the Maximal Multiplicative Family for the Class of Graph Continuous Functions