Graphs whose the maximum size of an odd subgraph equal to \(\lfloor \frac{n}{2} \rfloor \) (Q6994050)
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 8030351
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graphs whose the maximum size of an odd subgraph equal to \(\lfloor \frac{n}{2} \rfloor \) |
scientific article; zbMATH DE number 8030351 |
Statements
Graphs whose the maximum size of an odd subgraph equal to \(\lfloor \frac{n}{2} \rfloor \) (English)
0 references
24 April 2025
0 references
odd factors
0 references
odd subgraphs
0 references
perfect matchings
0 references
