scientific article
From MaRDI portal
Publication:3758854
zbMath0622.05026MaRDI QIDQ3758854
James A. Andrews, Michael S. Jacobson
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (21)
Unnamed Item ⋮ General-Appell polynomials within the context of monomiality principle ⋮ On the computational complexity of the bipartizing matching problem ⋮ Parameterized (Approximate) Defective Coloring ⋮ 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 ⋮ On improperly chromatic-choosable graphs ⋮ Co-2-plex vertex partitions ⋮ Improper colouring of (random) unit disk graphs ⋮ On minimal triangle-free graphs with prescribed \(k\)-defective chromatic number ⋮ Chromatic sums for colorings avoiding monochromatic subgraphs ⋮ Bounds and fixed-parameter algorithms for weighted improper coloring ⋮ Generalizations of independence and chromatic numbers of a graph ⋮ Conditional chromatic numbers with forbidden cycles ⋮ Chromatic partitions of a graph ⋮ Distributed deterministic edge coloring using bounded neighborhood independence ⋮ The subchromatic number of a graph ⋮ Bounded families for the on-line \(t\)-relaxed coloring ⋮ Defective Coloring on Classes of Perfect Graphs ⋮ Extremal results on defective colorings of graphs
This page was built for publication:
