Forbidden pairs and the existence of a dominating cycle
classification
🧮 math.CO
keywords
cycledominatingexistenceforbiddengraphpairscalledconnected
read the original abstract
A cycle in a graph is called dominating if every edge of the graph is incident with a vertex of the cycle. In this paper, we investigate forbidden pairs guaranteeing the existence of a dominating cycle in 2-connected graphs.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.