Pages that link to "Item:Q1318803"
From MaRDI portal
The following pages link to Extremal results on defective colorings of graphs (Q1318803):
Displaying 17 items.
- On minimal triangle-free graphs with prescribed \(k\)-defective chromatic number (Q539861) (← links)
- Bounds and fixed-parameter algorithms for weighted improper coloring (Q737104) (← links)
- On uniquely partitionable planar graphs (Q1584417) (← links)
- On generalized choice and coloring numbers (Q1733934) (← links)
- Minimal vertex Ramsey graphs and minimal forbidden subgraphs (Q1883248) (← links)
- The complexity of generalized graph colorings (Q1923585) (← links)
- Some defective parameters in graphs (Q1950405) (← links)
- On \(t\)-relaxed 2-distant circular coloring of graphs (Q2045235) (← links)
- Relaxed equitable colorings of planar graphs with girth at least 8 (Q2305904) (← links)
- Channel assignment problem and relaxed 2-distant coloring of graphs (Q2306601) (← links)
- Algorithms for a shared resource scheduling problem in which some level of conflict is tolerable (Q2434306) (← links)
- Improper colouring of (random) unit disk graphs (Q2476286) (← links)
- (Q3304104) (← links)
- On t-relaxed chromatic number of r-power paths (Q4634519) (← links)
- Parameterized (Approximate) Defective Coloring (Q5107096) (← links)
- Defective Coloring on Classes of Perfect Graphs (Q5864723) (← links)
- Graph partitions under average degree constraint (Q6187347) (← links)
