Pages that link to "Item:Q3795703"

The following pages link to A result on Hamiltonian line graphs involving restrictions on induced subgraphs (Q3795703):

Displaying 11 items.

• 2-factors with the bounded number of components in line graphs (Q628279) (← links)
• On the line graph of the zero divisor graph for the ring of Gaussian integers modulo \(n\) (Q666536) (← links)
• A lower bound on the Hamiltonian path completion number of a line graph (Q902504) (← links)
• The hamiltonian index of a 2-connected graph (Q998378) (← links)
• Collapsible graphs and reductions of line graphs (Q1025940) (← links)
• A linear algorithm for the Hamiltonian completion number of the line graph of a cactus. (Q1427178) (← links)
• A linear algorithm for the Hamiltonian completion number of the line graph of a tree (Q1603430) (← links)
• On the line graph of a graph with diameter 2 (Q2219967) (← links)
• Local search algorithms for finding the Hamiltonian completion number of line graphs (Q2468757) (← links)
• Pancyclic zero divisor graph over the ring ℤn[i] (Q6115757) (← links)
• Edge-diameter of a graph and its longest cycles (Q6133658) (← links)