How many disjoint 2-edge paths must a cubic graph have? (Q4446888): Difference between revisions
From MaRDI portal
Changed an 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 / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/jgt.10136 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4230967886 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3097395 / rank | |||
Normal rank | |||
Latest revision as of 13:42, 6 June 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
