scientific article; zbMATH DE number 3243267

Publication date: 1966

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Related Items

Partitions of hypergraphs under variable degeneracy constraints ⋮ Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties ⋮ The k‐path vertex cover: General bounds and chordal graphs ⋮ Generalized DP-colorings of graphs ⋮ Four proofs of the directed Brooks' theorem ⋮ Graph partitioning: an updated survey ⋮ Nordhaus–Gaddum problem in terms of G-free coloring ⋮ Partitioning of a graph into induced subgraphs not containing prescribed cliques ⋮ Majority choosability of countable graphs ⋮ Graph partitions under average degree constraint ⋮ Defective coloring of hypergraphs ⋮ Sparse critical graphs for defective DP-colorings ⋮ Almost-Fisher families ⋮ Embedding graphs in Euclidean space ⋮ Embedding graphs in Euclidean space ⋮ The $m$-degenerate chromatic number of a digraph ⋮ Decreasing the maximum average degree by deleting an independent set or a $d$-degenerate subgraph ⋮ Majority colourings of digraphs ⋮ A Catlin-type theorem for graph partitioning avoiding prescribed subgraphs ⋮ Vertex arboricity and maximum degree ⋮ Approximation of Constraint Satisfaction via local search ⋮ Vertex-disjoint subgraphs with high degree sums ⋮ On path decompositions of $2k$-regular graphs ⋮ Graph decomposition with constraints in the minimum degree ⋮ Brooks' Theorem and Beyond ⋮ Grid representations and the chromatic number ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ Colorings of plane graphs without long monochromatic facial paths ⋮ On path decompositions of $2 k$-regular graphs ⋮ Facially-constrained colorings of plane graphs: a survey ⋮ Improper Choosability and Property B ⋮ Decomposition of graphs with constraint on minimum degree ⋮ 2-subcoloring is NP-complete for planar comparability graphs ⋮ On a conjecture of Schweser and Stiebitz ⋮ Coloring subgraphs with restricted amounts of hues ⋮ The path partition conjecture is true for claw-free graphs ⋮ On two problems in graph Ramsey theory ⋮ Partitions of graphs into cographs ⋮ Majority choosability of digraphs ⋮ Relaxed two-coloring of cubic graphs ⋮ Reprint of: ``Grid representations and the chromatic number ⋮ A comparison of integer programming models for the partial directed weighted improper coloring problem ⋮ On 1-improper 2-coloring of sparse graphs ⋮ Graphs with $\chi=\Delta$ Have Big Cliques ⋮ Weighted improper colouring ⋮ On the computational complexity of the bipartizing matching problem ⋮ On a problem of Chvatal ⋮ The t-improper chromatic number of random graphs ⋮ A note on partitions of graphs under degree constraints ⋮ Bounded size components -- partitions and transversals. ⋮ On the existence of vertex-disjoint subgraphs with high degree sum ⋮ Partitioning into graphs with only small components ⋮ Majority edge-colorings of graphs ⋮ Subcolorings and the subchromatic number of a graph ⋮ Almost-Fisher families ⋮ On computing the minimum 3-path vertex cover and dissociation number of graphs ⋮ On the vertex $k$-path cover ⋮ Coloring a graph with $\Delta-1$ colors: conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker ⋮ Majority coloring game ⋮ On 2-defective DP-colorings of sparse graphs ⋮ Defective DP-colorings of sparse multigraphs ⋮ Partitions of multigraphs under minimum degree constraints ⋮ On t-relaxed chromatic number of r-power paths ⋮ On improperly chromatic-choosable graphs ⋮ Co-2-plex vertex partitions ⋮ Defective DP-colorings of sparse simple graphs ⋮ Isomorphic bisections of cubic graphs ⋮ Destroying Noncomplete Regular Components in Graph Partitions ⋮ On splitting digraphs ⋮ The complexity of partitioning into disjoint cliques and a triangle-free graph ⋮ Partial domination - the isolation number of a graph ⋮ WORM colorings of planar graphs ⋮ Improper colouring of (random) unit disk graphs ⋮ New results on $k$-independence of graphs ⋮ A note on a cycle partition problem ⋮ A note on coloring digraphs of large girth ⋮ On minimal triangle-free graphs with prescribed $k$-defective chromatic number ⋮ Path partitions and $P_{n}$-free sets ⋮ Improved approximation algorithms for path vertex covers in regular graphs ⋮ A hypocoloring model for batch scheduling ⋮ Satisfactory graph partition, variants, and generalizations ⋮ On monochromatic component size for improper colourings ⋮ Acyclic improper colouring of graphs with maximum degree 4 ⋮ On an upper bound of the graph's chromatic number, depending on the graph's degree and density ⋮ Minimum $k$-path vertex cover ⋮ A bound on the chromatic number of a graph ⋮ Injective edge-coloring of graphs with given maximum degree ⋮ A generalization of Stiebitz-type results on graph decomposition ⋮ Another bound on the chromatic number of a graph ⋮ Vertex partition of hypergraphs and maximum degenerate subhypergraphs ⋮ Vertex-Coloring with Star-Defects ⋮ Chromatic number, girth and maximal degree ⋮ Worm colorings ⋮ Bounds and fixed-parameter algorithms for weighted improper coloring ⋮ On partitions of $K_{2, 3}$-free graphs under degree constraints ⋮ List injective edge-coloring of subcubic graphs ⋮ Relaxed equitable colorings of planar graphs with girth at least 8 ⋮ Induced subgraphs with many repeated degrees ⋮ Defective and clustered choosability of sparse graphs ⋮ Channel assignment problem and relaxed 2-distant coloring of graphs ⋮ Independent sets in bounded-degree hypergraphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Geometrical embeddings of graphs ⋮ Graph partitions with minimum degree constraints ⋮ Generalized independence and domination in graphs ⋮ My Top 10 Graph Theory Conjectures and Open Problems ⋮ Immersion and clustered coloring ⋮ On a tree-partition problem ⋮ Vertex coloring edge-weighted digraphs ⋮ An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem ⋮ Extremal results on defective colorings of graphs ⋮ A Linear-Time Algorithm for Finding Induced Planar Subgraphs ⋮ Graphical decompositions ⋮ Relaxed chromatic numbers of graphs