Pages that link to "Item:Q1382811"
From MaRDI portal
The following pages link to An algorithm for coloring some perfect graphs (Q1382811):
Displaying 11 items.
- Coloring perfect \((K_ 4\)-e)-free graphs (Q1071025) (← links)
- A reduction procedure for coloring perfect \(K_ 4\)-free graphs (Q1096639) (← links)
- On Tucker vertices of graphs (Q1301659) (← links)
- An algorithm for colouring perfect planar graphs (Q1825203) (← links)
- Perfect colorings of the prism graph (Q2402206) (← links)
- An exact method for graph coloring (Q2489282) (← links)
- Colouring Some Classes of Perfect Graphs Robustly (Q3439399) (← links)
- (Q3475285) (← links)
- Exact Algorithms for Coloring Graphs While Avoiding Monochromatic Cycles (Q3578378) (← links)
- (Q4344207) (← links)
- On word colourings and some perfect graphs (Q4712203) (← links)