Pan-factorial property in regular graphs (Q2583675)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2248145
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Pan-factorial property in regular graphs |
scientific article; zbMATH DE number 2248145 |
Statements
Pan-factorial property in regular graphs (English)
0 references
17 January 2006
0 references
Summary: Among other results, we show that if for any given edge \(e\) of an \(r\)-regular graph \(G\) of even order, \(G\) has a 1-factor containing \(e\), then \(G\) has a \(k\)-factor containing \(e\) and another one avoiding \(e\) for all \(k\), \(1\leq k\leq r-1\).
0 references
0.8625758290290833
0 references
0.8425403237342834
0 references
0.838287889957428
0 references
0.8282849192619324
0 references
