The following pages link to (Q3758854):
Displaying 32 items.
- General-Appell polynomials within the context of monomiality principle (Q355555) (← links)
- On improperly chromatic-choosable graphs (Q497383) (← links)
- Co-2-plex vertex partitions (Q498448) (← links)
- On minimal triangle-free graphs with prescribed \(k\)-defective chromatic number (Q539861) (← links)
- Bounds and fixed-parameter algorithms for weighted improper coloring (Q737104) (← links)
- Bounded families for the on-line \(t\)-relaxed coloring (Q1044722) (← links)
- Chromatic partitions of a graph (Q1263595) (← links)
- A generalization of chromatic index (Q1313837) (← links)
- Extremal results on defective colorings of graphs (Q1318803) (← links)
- On the mean chromatic number (Q1322240) (← links)
- Generalizations of independence and chromatic numbers of a graph (Q1801703) (← links)
- Conditional chromatic numbers with forbidden cycles (Q1805306) (← links)
- The subchromatic number of a graph (Q1823255) (← links)
- On the space chromatic number (Q1849964) (← links)
- Approximation algorithms for finding and partitioning unit-disk graphs into co-\(k\)-plexes (Q1958629) (← links)
- Additive non-approximability of chromatic number in proper minor-closed classes (Q2099409) (← links)
- Improper interval edge colorings of graphs (Q2235270) (← links)
- Reflection on the coloring and chromatic numbers (Q2416518) (← 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)
- Chromatic sums for colorings avoiding monochromatic subgraphs (Q2516680) (← links)
- On the computational complexity of the bipartizing matching problem (Q2675722) (← links)
- Parameterized (approximate) defective coloring (Q3304104) (← links)
- On Counting Generalized Colorings (Q3540189) (← links)
- Chromatic zeros and generalized Fibonacci numbers (Q3655054) (← links)
- (Q3788046) (← links)
- (Q4053658) (← links)
- Parameterized (Approximate) Defective Coloring (Q5107096) (← links)
- Defective Coloring on Classes of Perfect Graphs (Q5864723) (← links)
- (Q5869435) (← links)
- Distributed deterministic edge coloring using bounded neighborhood independence (Q5920296) (← links)
- Planar graphs without 4- and 6-cycles are \(( 3 , 4 )\)-colorable (Q6585244) (← links)
