The following pages link to (Q3351379):
Displaying 21 items.
- Colouring perfect graphs with bounded clique number (Q345123) (← links)
- Perfect graphs of arbitrarily large clique-chromatic number (Q896010) (← links)
- On the maximum \(q\)-colourable induced subgraph problem in perfect graphs (Q964478) (← links)
- A note on perfect graphs (Q1084108) (← links)
- Alternating orientation and alternating colouration of perfect graphs (Q1089007) (← links)
- On locally-perfect colorings (Q1121900) (← links)
- The complexity of \(G\)-free colourability (Q1356726) (← links)
- On a conjecture about uniquely colorable perfect graphs (Q1377674) (← links)
- The existence of uniquely \(-G\) colourable graphs (Q1377702) (← links)
- An algorithm for coloring some perfect graphs (Q1382811) (← links)
- Generalized perfect graphs: Characterizations and inversion (Q1894378) (← links)
- The complexity of generalized graph colorings (Q1923585) (← links)
- Perfectly colorable graphs (Q1944175) (← links)
- Perfect matchings in shadow colorings (Q2220968) (← links)
- Perfect graphs (Q2822594) (← links)
- On a perfect problem (Q3508843) (← links)
- Soft Edge Coloring (Q3603465) (← links)
- Distance perfectness of graphs (Q4264523) (← links)
- (Q4873192) (← links)
- Testing superperfection of k-trees (Q5056149) (← links)
- (Q5474623) (← links)