The following pages link to Brice Effantin (Q284756):
Displaying 18 items.
- A characterization of \(b\)-chromatic and partial Grundy numbers by induced subgraphs (Q284759) (← links)
- (Q612964) (redirect page) (← links)
- New results about set colorings of graphs (Q612965) (← links)
- \([r,s,t]\)-colorings of graph products (Q742628) (← links)
- \([r,s,t]\)-coloring of trees and bipartite graphs (Q960923) (← links)
- On the game coloring index of \(F^+\)-decomposable graphs (Q1693133) (← links)
- The b-chromatic number of power graphs of complete caterpillars (Q3379157) (← links)
- Sum coloring of distance and circulant graphs (Q3439341) (← links)
- (Q3565943) (← links)
- (Q4483922) (← links)
- (Q4595236) (← links)
- Exact values for the<i>b</i>-chromatic number of a power complete<i>k</i>-ary tree (Q4678480) (← links)
- Distance edge coloring and collision‐free communication in wireless sensor networks (Q5326804) (← links)
- (Q5419845) (← links)
- Grundy number of graphs (Q5444051) (← links)
- A Self-stabilizing Algorithm for the Minimum Color Sum of a Graph (Q5445753) (← links)
- The b$_q$-coloring of graphs (Q6128972) (← links)
- Incidence, a Scoring Positional Game on Graphs (Q6415914) (← links)
