Conditions for graphs to be path partition optimal (Q1709536): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q130194299, #quickstatements; #temporary_batch_1729946815562 |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.disc.2018.02.011 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DISC.2018.02.011 / rank | |||
Normal rank | |||
Latest revision as of 05:13, 11 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Conditions for graphs to be path partition optimal |
scientific article |
Statements
Conditions for graphs to be path partition optimal (English)
0 references
5 April 2018
0 references
path partition number
0 references
separable degree
0 references
path partition optimal
0 references
forbidden subgraph
0 references
heavy subgraph
0 references
heft index
0 references
