How many disjoint 2-edge paths must a cubic graph have? (Q4446888): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:13, 7 February 2024
scientific article; zbMATH DE number 2037545
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | How many disjoint 2-edge paths must a cubic graph have? |
scientific article; zbMATH DE number 2037545 |
Statements
How many disjoint 2-edge paths must a cubic graph have? (English)
0 references
3 February 2004
0 references
packing
0 references
2-edge path
0 references
cubic graph
0 references
polynomial time algorithm
0 references
