Pages that link to "Item:Q3971918"
From MaRDI portal
The following pages link to Interval edge-coloring of caterpillars with hairs of arbitrary length (Q3971918):
Displaying 7 items.
- The complexity of scheduling independent two-processor tasks on dedicated processors (Q1107984) (← links)
- The color cost of a caterpillar (Q1377806) (← links)
- A linear time algorithm for edge coloring of binomial trees (Q1916114) (← links)
- The Proper Interval Colored Graph problem for caterpillar trees (Q3439122) (← links)
- On the proper intervalization of colored caterpillar trees (Q3653091) (← links)
- Balanced caterpillars of maximum degree 3 and with hairs of arbitrary length are subgraphs of their optimal hypercube (Q4638647) (← links)
- The hardness of intervalizing four colored caterpillars (Q5937916) (← links)