tailieunhanh - Longest cycles and restgraph in maximalnonhamitonian graphs

A graph is called a maximalnonhamiltonian graph if it is nonhamiltonian and will be hamiltonian by adding any new edge. This paper presents a conjecture that if C is a longest cycle in a maximalnonhamiltonian graph G then G−C is a complete graph and shows that the conjecture is true for some classes of graphs. |

TỪ KHÓA LIÊN QUAN