http://pco.iis.nsk.su/grapp/index.php?title=Halin_graph&feed=atom&action=historyHalin graph - История изменений2024-03-29T02:29:35ZИстория изменений этой страницы в викиMediaWiki 1.39.3http://pco.iis.nsk.su/grapp/index.php?title=Halin_graph&diff=7538&oldid=prevGlk: Новая страница: «'''Halin graph''' --- граф Халина. <math>G</math> is a '''Halin graph''' if <math>G</math> is formed by embedding a tree having no degree-2 vertices in t…»2011-05-17T08:13:22Z<p>Новая страница: «'''Halin graph''' --- граф Халина. <math>G</math> is a '''Halin graph''' if <math>G</math> is formed by embedding a tree having no degree-2 vertices in t…»</p>
<p><b>Новая страница</b></p><div>'''Halin graph''' --- граф Халина. <br />
<br />
<math>G</math> is a '''Halin graph''' if <math>G</math> is formed by embedding a tree having no<br />
degree-2 vertices in the plane, and connecting its ''leaves'' by a<br />
''cycle'' that crosses none of its edges. '''Halin graph'''s are<br />
3-connected and have a ''Hamiltonian circuit''.</div>Glk