The perfectly matchable subgraph polytope of an arbitrary graph (Q757431): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Perfect matchings of a graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The perfectly matchable subgraph polytope of a bipartite graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The perfectly matchable subgraph polytope of an arbitrary graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Paths, Trees, and Flowers / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4078069 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Factorization of Linear Graphs / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 14:12, 21 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The perfectly matchable subgraph polytope of an arbitrary graph |
scientific article |
Statements
The perfectly matchable subgraph polytope of an arbitrary graph (English)
0 references
1989
0 references
perfectly matchable subgraph polytope
0 references
