Pages that link to "Item:Q3614195"

The following pages link to A New Algorithm for On-line Coloring Bipartite Graphs (Q3614195):

Displaying 8 items.

• On the complexity of injective colorings and its generalizations (Q387816) (← links)
• An on-line competitive algorithm for coloring bipartite graphs without long induced paths (Q524365) (← links)
• A Gram classification of principal Cox-regular edge-bipartite graphs via inflation algorithm (Q1634759) (← links)
• A Coxeter spectral classification of positive edge-bipartite graphs. I: Dynkin types \(\mathcal{B}_n\), \(\mathcal{C}_n\), \(\mathcal{F}_4\), \(\mathcal{G}_2\), \(\mathbb{E}_6\), \(\mathbb{E}_7\), \(\mathbb{E}_8\) (Q1790462) (← links)
• Symbolic computation of strong Gram congruences for Cox-regular positive edge-bipartite graphs with loops (Q2419038) (← links)
• Open Problems on Graph Coloring for Special Graph Classes (Q2827799) (← links)
• An On-line Competitive Algorithm for Coloring $$P_8$$-free Bipartite Graphs (Q2942656) (← links)
• Online Graph Coloring Against a Randomized Adversary (Q3177338) (← links)