Pages that link to "Item:Q1377872"
From MaRDI portal
The following pages link to On-line 3-chromatic graphs. II: Critical graphs (Q1377872):
Displaying 12 items.
- A characterization of \(b\)-chromatic and partial Grundy numbers by induced subgraphs (Q284759) (← links)
- Minimum order of graphs with given coloring parameters (Q488290) (← links)
- An on-line competitive algorithm for coloring bipartite graphs without long induced paths (Q524365) (← links)
- Results on the Grundy chromatic number of graphs (Q856867) (← links)
- Computational aspects of greedy partitioning of graphs (Q1702844) (← links)
- Complexity of Grundy coloring and its variants (Q1752449) (← links)
- On the on-line chromatic number of the family of on-line 3-chromatic graphs (Q1916112) (← links)
- New potential functions for greedy independence and coloring (Q2255044) (← links)
- Grundy Coloring and friends, half-graphs, bicliques (Q2700380) (← links)
- An On-line Competitive Algorithm for Coloring $$P_8$$-free Bipartite Graphs (Q2942656) (← links)
- Deciding the On-line Chromatic Number of a Graph with Pre-coloring Is PSPACE-Complete (Q2947029) (← links)
- On Computational Aspects of Greedy Partitioning of Graphs (Q4632201) (← links)
