Pages that link to "Item:Q3552506"
From MaRDI portal
The following pages link to Conflict-Free Colourings of Graphs and Hypergraphs (Q3552506):
Displaying 42 items.
- Complexity of conflict-free colorings of graphs (Q484316) (← links)
- On variants of conflict-free-coloring for hypergraphs (Q507574) (← links)
- Selective hypergraph colourings (Q906467) (← links)
- Unique-maximum coloring of plane graphs (Q907833) (← links)
- Conflict-free connections of graphs (Q1656907) (← links)
- On conflict-free connection of graphs (Q1727736) (← links)
- Graphs with conflict-free connection number two (Q1756118) (← links)
- Conflict free colorings of (strongly) almost disjoint set-systems (Q1945294) (← links)
- Conflict-free coloring of string graphs (Q2022631) (← links)
- Conflict-free connection number and independence number of a graph (Q2025169) (← links)
- Conflict-free connection of trees (Q2051900) (← links)
- Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods (Q2097169) (← links)
- Remarks on proper conflict-free colorings of graphs (Q2099465) (← links)
- Conflict-free coloring: graphs of bounded clique width and intersection graphs (Q2115843) (← links)
- Conflict-free coloring bounds on open neighborhoods (Q2161000) (← links)
- Structural parameterization for minimum conflict-free colouring (Q2161251) (← links)
- A tight bound for conflict-free coloring in terms of distance to cluster (Q2166302) (← links)
- Colorings with neighborhood parity condition (Q2172422) (← links)
- Conflict-free connection number of random graphs (Q2192106) (← 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)
- Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs (Q2891368) (← links)
- Conflict-Free Colourings of Uniform Hypergraphs With Few Edges (Q2908131) (← links)
- On Conflict-Free Multi-coloring (Q3449809) (← links)
- Maximum value of conflict-free vertex-connection number of graphs (Q4554541) (← links)
- Conflict-Free Coloring of Graphs (Q4556952) (← links)
- Conflict-Free Coloring of Intersection Graphs (Q4557736) (← links)
- INFINITE COMBINATORICS PLAIN AND SIMPLE (Q4692090) (← links)
- Parameterized Complexity of Conflict-Free Graph Coloring (Q4959657) (← links)
- A Short Note on Open-Neighborhood Conflict-Free Colorings of Graphs (Q5128500) (← links)
- (Q5136250) (← links)
- Conflict-Free Colouring of Graphs (Q5418810) (← 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)
- Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth (Q6080127) (← links)
- On odd colorings of planar graphs (Q6080172) (← 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)
