Back to Search Start Over

4-Cycle Systems of $$K_n - E(F^*)$$ K n - E ( F ∗ )

Authors :
Nidhi Sehgal
Christopher A. Rodger
Source :
Graphs and Combinatorics. 31:1703-1714
Publication Year :
2014
Publisher :
Springer Science and Business Media LLC, 2014.

Abstract

In this paper necessary and sufficient conditions are found for the existence of a $$4$$4-cycle system of a complete graph on $$n$$n vertices with leave a nearly $$2$$2-regular graph (that is, a not necessarily spanning graph in which all vertices have degree 2 except for one of degree greater than 2).

Details

ISSN :
14355914 and 09110119
Volume :
31
Database :
OpenAIRE
Journal :
Graphs and Combinatorics
Accession number :
edsair.doi...........728937ec430f74c51f80c3cc02cd960b