scientific article; zbMATH DE number 4008419
From MaRDI portal
Publication:3758854
Recommendations
Cited in
(36)- Bounded families for the on-line \(t\)-relaxed coloring
- Chromatic partitions of a graph
- A generalization of chromatic index
- Extremal results on defective colorings of graphs
- On the mean chromatic number
- Generalizations of independence and chromatic numbers of a graph
- Conditional chromatic numbers with forbidden cycles
- The subchromatic number of a graph
- On the space chromatic number
- Approximation algorithms for finding and partitioning unit-disk graphs into co-k-plexes
- Additive non-approximability of chromatic number in proper minor-closed classes
- Improper interval edge colorings of graphs
- Reflection on the coloring and chromatic numbers
- Algorithms for a shared resource scheduling problem in which some level of conflict is tolerable
- Improper colouring of (random) unit disk graphs
- Chromatic sums for colorings avoiding monochromatic subgraphs
- On the computational complexity of the bipartizing matching problem
- Parameterized (approximate) defective coloring
- On Counting Generalized Colorings
- General-Appell polynomials within the context of monomiality principle
- Chromatic zeros and generalized Fibonacci numbers
- scientific article; zbMATH DE number 4051672 (Why is no real title available?)
- scientific article; zbMATH DE number 3468845 (Why is no real title available?)
- On improperly chromatic-choosable graphs
- Co-2-plex vertex partitions
- Parameterized (approximate) defective coloring
- On minimal triangle-free graphs with prescribed \(k\)-defective chromatic number
- Defective Coloring on Classes of Perfect Graphs
- scientific article; zbMATH DE number 7593849 (Why is no real title available?)
- Distributed deterministic edge coloring using bounded neighborhood independence
- Planar graphs without 4- and 6-cycles are \(( 3 , 4 )\)-colorable
- On the structural parameterized complexity of defective coloring
- On the strong Bordeaux conjecture
- Structural parameterizations for two bounded degree problems revisited
- Independent mutual-visibility coloring and related concepts
- Bounds and fixed-parameter algorithms for weighted improper coloring
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3758854)
