The following pages link to (Q4871751):
Displaying 16 items.
- On bounding the difference of the maximum degree and the clique number (Q497368) (← links)
- Eulerian colorings and the bipartizing matchings conjecture of Fleischner (Q852699) (← links)
- Shellable graphs and sequentially Cohen-Macaulay bipartite graphs (Q942170) (← links)
- Maximum-weight stable sets and safe lower bounds for graph coloring (Q1946922) (← links)
- The \(v\)-number of edge ideals (Q2005190) (← links)
- Cycles in color-critical graphs (Q2121717) (← links)
- On bounding the difference between the maximum degree and the chromatic number by a constant (Q2403810) (← links)
- Chromatic capacity and graph operations (Q2483394) (← links)
- On \(\alpha\)-critical edges in König--Egerváry graphs (Q2502896) (← links)
- Reconfiguration of colorable sets in classes of perfect graphs (Q2632018) (← links)
- Colouring Some Classes of Perfect Graphs Robustly (Q3439399) (← links)
- On word colourings and some perfect graphs (Q4712203) (← links)
- Reconfiguration of Colorable Sets in Classes of Perfect Graphs (Q5116491) (← links)
- (Q5206906) (← links)
- (Q5708618) (← links)
- Mod 3 arithmetic on triangulated Riemann surfaces (Q5941507) (← links)