REMOVABLE EDGES ON A HAMILTON CYCLE OR OUTSIDE A CYCLE IN A 4-CONNECTED GRAPH

Wu, JC; Broersma, H; Mao, YP; Ma, Q

Ma, Q (corresponding author), Ohio State Univ, Coll Med, Dept Biomed Informat, Columbus, OH 43210 USA.

DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2021; 41 (2): 559

Abstract

Let G be a 4-connected graph. We call an edge e of G removable if the following sequence of operations results in a 4-connected graph: delete e from G......

Full Text Link