scientific article
From MaRDI portal
Publication:3744180
zbMath0606.05025MaRDI QIDQ3744180
Kathryn Fraughnaugh Jones, Frank Harary
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (16)
On the computational complexity of the bipartizing matching problem ⋮ The t-improper chromatic number of random graphs ⋮ Algorithms for a shared resource scheduling problem in which some level of conflict is tolerable ⋮ Approximation algorithms for finding and partitioning unit-disk graphs into co-\(k\)-plexes ⋮ Improper interval edge colorings of graphs ⋮ Improper colouring of (random) unit disk graphs ⋮ Local coloring of Kneser graphs ⋮ Vertex-Coloring with Star-Defects ⋮ Chromatic sums for colorings avoiding monochromatic subgraphs ⋮ Bounds and fixed-parameter algorithms for weighted improper coloring ⋮ Conditional chromatic numbers with forbidden cycles ⋮ Distributed deterministic edge coloring using bounded neighborhood independence ⋮ Degree tolerant coloring of graph ⋮ Bounded families for the on-line \(t\)-relaxed coloring ⋮ An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem ⋮ Extremal results on defective colorings of graphs
This page was built for publication:
