Graph Structural Properties of Non-Yutsis Graphs Allowing Fast Recognition
Yutsis graphs are connected simple graphs which can be partitioned into two vertex-induced trees. Cubic Yutsis graphs were introduced by Jaeger as cubic dual Hamiltonian graphs, and these are our main focus. Cubic Yutsis graphs also appear in the context
|Collections||ANU Research Publications|
|Source:||Discrete Applied Mathematics|
|01_Aldred_Graph_Structural_Properties_of_2008.pdf||719.76 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.