( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
More than one tough chordal planar graphs are Hamiltonian.

, , и . J. Graph Theory, 32 (4): 405-410 (1999)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Thomas Böhme

Thomas Böhme

Thomas Böhme

Thomas Böhme

Thomas Böhme

 

Другие публикации лиц с тем же именем

Ordered and linked chordal graphs., , и . Discuss. Math. Graph Theory, 28 (2): 367-373 (2008)A planarity criterion for cubic bipartite graphs., , , и . Discret. Math., 191 (1-3): 31-43 (1998)Labeled K2, t Minors in Plane Graphs., и . J. Comb. Theory, Ser. B, 84 (2): 291-300 (2002)A Note on Semi-steady States in Stochastic Cellular Automata., , и . Autonomous Systems: Developments and Trends, том 391 из Studies in Computational Intelligence, Springer, (2012)More than one tough chordal planar graphs are Hamiltonian., , и . J. Graph Theory, 32 (4): 405-410 (1999)On certain Hamiltonian cycles in planar graphs., , и . J. Graph Theory, 32 (1): 81-96 (1999)Local Computation of Vertex Colorings., и . CTW, стр. 76-79. (2011)Minors in Graphs with High Chromatic Number., , и . Comb. Probab. Comput., 20 (4): 513-518 (2011)Hadwiger numbers and over-dominating colourings., , и . Discret. Math., 310 (20): 2662-2665 (2010)Ka, k Minors in Graphs of Bounded Tree-Width., , и . J. Comb. Theory, Ser. B, 86 (1): 133-147 (2002)