A characterization of PM-compact claw-free cubic graphs (Q2875690)
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: A characterization of PM-compact claw-free cubic graphs |
scientific article; zbMATH DE number 6328442
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A characterization of PM-compact claw-free cubic graphs |
scientific article; zbMATH DE number 6328442 |
Statements
11 August 2014
0 references
perfect matching polytope
0 references
perfect-matching graph
0 references
A characterization of PM-compact claw-free cubic graphs (English)
0 references
The main result of the authors characterizes the perfect matching compact (in the following called `PM-compact') claw-free cubic matching-covered graphs. With the help of their results they conclude that each PM-compact claw-free bridgeless cubic graph has six perfect matchings such that every edge appears in exactly two of them.
0 references
0.8729458451271057
0 references
0.8151624202728271
0 references
0.8013476133346558
0 references
0.7998611330986023
0 references
0.7897188067436218
0 references
