Pages that link to "Item:Q1578404"
From MaRDI portal
The following pages link to A linear algorithm for finding \([g,f]\)-colorings of partial \(k\)-trees (Q1578404):
Displaying 9 items.
- \((p,k)\)-coloring problems in line graphs (Q817821) (← links)
- A note on the \((g, f)\)-coloring (Q949352) (← links)
- Algorithms for finding distance-edge-colorings of graphs (Q2457301) (← links)
- Linear Time Algorithms for Happy Vertex Coloring Problems for Trees (Q2819511) (← links)
- Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
- Locally bounded<i>k</i>-colorings of trees (Q3621974) (← links)
- Edge coloring a k-tree into two smaller trees (Q4347271) (← links)
- (Q4808664) (← links)
- Algorithms for finding f-colorings of partial k-trees (Q6487980) (← links)