Noncrossing subgraphs in topological graph K3,3

Noncrossing subgraphs in topological graph K3,3

0.00 Avg rating—0 Votes
Article ID: iaor2006580
Country: Belarus
Volume: 49
Issue: 3
Start Page Number: 8
End Page Number: 13
Publication Date: May 2005
Journal: Doklady of the National Academy of Sciences of Belarus
Authors:
Abstract:

It is proved that in arbitrary simple topological graph K3,3 there exists a noncrossing Hamiltonian path if the number of all crossings in the graph is not equal to 9 and there always exists a noncrossing spanning tree.

Reviews

Required fields are marked *. Your email address will not be published.