scientific article; zbMATH DE number 3979083
From MaRDI portal
Publication:3744180
Recommendations
Cited in
(23)- Complexity of conditional colorability of graphs
- Bounded families for the on-line \(t\)-relaxed coloring
- Extremal results on defective colorings of graphs
- Conditional chromatic numbers with forbidden cycles
- Approximation algorithms for finding and partitioning unit-disk graphs into co-k-plexes
- Degree tolerant coloring of graph
- Improper interval edge colorings of graphs
- Algorithms for a shared resource scheduling problem in which some level of conflict is tolerable
- Improper colouring of (random) unit disk graphs
- Conditional colorings of graphs
- Chromatic sums for colorings avoiding monochromatic subgraphs
- On the computational complexity of the bipartizing matching problem
- Vertex-coloring with star-defects
- Several sufficient conditions of a normal graph in conditional coloring
- The t-improper chromatic number of random graphs
- Generalized chromatic numbers of graphs with bipartite complements
- scientific article; zbMATH DE number 4053680 (Why is no real title available?)
- scientific article; zbMATH DE number 25546 (Why is no real title available?)
- An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem
- Distributed deterministic edge coloring using bounded neighborhood independence
- Planar graphs without 4- and 6-cycles are \(( 3 , 4 )\)-colorable
- Bounds and fixed-parameter algorithms for weighted improper coloring
- Local coloring of Kneser graphs
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 Q3744180)
