The following pages link to Conflict-Free Colouring of Graphs (Q5418810):
Displaying 27 items.
- Theory and application of conflict resolution with hybrid preference in colored graphs (Q350409) (← links)
- Complexity of conflict-free colorings of graphs (Q484316) (← links)
- Conflict free colorings of nonuniform systems of infinite sets (Q663080) (← links)
- Minimum conflict free colouring parameterized by treewidth (Q779250) (← links)
- Unique-maximum coloring of plane graphs (Q907833) (← links)
- Conflict-free coloring of unit disks (Q1028125) (← links)
- Conflict-free coloring of string graphs (Q2022631) (← links)
- Remarks on proper conflict-free colorings of graphs (Q2099465) (← links)
- Structural parameterization for minimum conflict-free colouring (Q2161251) (← links)
- Colorings with neighborhood parity condition (Q2172422) (← links)
- Conflict-free coloring of intersection graphs of geometric objects (Q2207603) (← links)
- Non-monochromatic and conflict-free colorings on tree spaces and planar network spaces (Q2309464) (← links)
- Brooks type results for conflict-free colorings and \(\{a, b \}\)-factors in graphs (Q2515567) (← links)
- (Q2990991) (← links)
- Conflict-Free Coloring of Graphs (Q4556952) (← links)
- Conflict-Free Coloring of Intersection Graphs (Q4557736) (← links)
- Parameterized Complexity of Conflict-Free Graph Coloring (Q4959657) (← links)
- Conflict-free coloring of intersection graphs (Q5136250) (← links)
- Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs (Q5745127) (← links)
- 1-planar graphs are odd 13-colorable (Q6041551) (← links)
- On conflict-free proper colourings of graphs without small degree vertices (Q6056427) (← links)
- Conflict‐free chromatic number versus conflict‐free chromatic index (Q6057644) (← links)
- Colouring a dominating set without conflicts: \(q\)-subset square colouring (Q6077071) (← links)
- A short note on conflict‐free coloring on closed neighborhoods of bounded degree graphs (Q6080863) (← links)
- A note on the conflict-free chromatic index (Q6197755) (← links)
- A survey on conflict-free connection coloring of graphs (Q6497946) (← links)
- Conflict-free coloring: graphs of bounded clique-width and intersection graphs (Q6582374) (← links)
