All \(P_{3}\)-equipackable graphs (Q960935)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: All Pā-equipackable graphs |
scientific article; zbMATH DE number 5687564
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | All \(P_{3}\)-equipackable graphs |
scientific article; zbMATH DE number 5687564 |
Statements
All \(P_{3}\)-equipackable graphs (English)
0 references
29 March 2010
0 references
A connected graph \(G\) is called equipackable if \textit{any} sequence of removals of two adjacent edges terminates with the empty graph (if \(G\) has an even number of edges) or with a single edge (if \(G\) has an odd number of edges). This paper characterizes all equipackable graphs.
0 references
Packing
0 references
Equitable
0 references
Decomposition
0 references
0.8528635501861572
0 references
0.8504685163497925
0 references
0.8375742435455322
0 references
0.8194766044616699
0 references
0.8069557547569275
0 references
