Pages that link to "Item:Q4538085"
From MaRDI portal
The following pages link to Tools for Multicoloring with Applications to Planar Graphs and Partial k-Trees (Q4538085):
Displaying 16 items.
- On a local protocol for concurrent file transfers (Q487273) (← links)
- On sum coloring and sum multi-coloring for restricted families of graphs (Q764335) (← links)
- Perfectness and imperfectness of unit disk graphs on triangular lattice points (Q1043621) (← links)
- Precoloring extension. I: Interval graphs (Q1198648) (← links)
- Multicoloring trees. (Q1401922) (← links)
- Graph multi-coloring for a job scheduling application (Q1686066) (← links)
- Optimal shift coloring of trees (Q1785225) (← links)
- Sum coloring interval and \(k\)-claw free graphs with application to scheduling dependent jobs (Q1879365) (← links)
- Bandwidth consecutive multicolorings of graphs (Q2445874) (← links)
- A short proof of the NP-completeness of minimum sum interval coloring (Q2488233) (← links)
- Minimum sum multicoloring on the edges of trees (Q2503344) (← links)
- Batch Coloring Flat Graphs and Thin (Q3512459) (← links)
- (Q4808664) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311104) (← links)
- Approximation and Online Algorithms (Q5713445) (← links)
- Approximation and Online Algorithms (Q5713450) (← links)