Uniform (<i>C</i><sub><i>k</i></sub>, <i>P</i><sub><i>k</i>+1</sub>)-Factorizations of <i>K</i><sub><i>n</i></sub> − <i>I</i> When <i>k</i> Is Even

Uniform (<i>C</i><sub><i>k</i></sub>, <i>P</i><sub><i>k</i>+1</sub>)-Factorizations of <i>K</i><sub><i>n</i></sub> − <i>I</i> When <i>k</i> Is Even

Let <i>H</i> be a connected subgraph of a graph <i>G</i>. An <i>H</i>-factor of <i>G</i> is a spanning subgraph of <i>G</i> whose components are isomorphic to <i>H</i>. Given a set <inline-formula><math xmlns="http...

Full description

Bibliographic Details
Main Authors: Giovanni Lo Faro, Salvatore Milici, Antoinette Tripodi
Format: Article
Language:English
Published: MDPI AG 2022-03-01
Series:Mathematics
Subjects:
graph factorization
complete graph
block design
Online Access:https://www.mdpi.com/2227-7390/10/6/936

Internet

https://www.mdpi.com/2227-7390/10/6/936

Similar Items