Packingk-edge trees in graphs of restricted vertex degrees (Q3594953): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2953266710 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: math/0610384 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3097395 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4331842 / rank | |||
Normal rank |
Latest revision as of 13:17, 26 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Packingk-edge trees in graphs of restricted vertex degrees |
scientific article |
Statements
Packingk-edge trees in graphs of restricted vertex degrees (English)
0 references
9 August 2007
0 references
subgraph packing
0 references
2-edge and \(k\)-edge paths
0 references
\(k\)-edge trees
0 references
polynomial time approximation algorithms
0 references