scientific article; zbMATH DE number 3043302

zbMath0027.26403MaRDI QIDQ5782525

No author found.

Publication date: 1941

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

zbMATH Keywords

Topology

Related Items (only showing first 100 items - show all)

The \(m\)-degenerate chromatic number of a digraph ⋮ Coloring signed graphs using DFS ⋮ On \(r\)-dynamic coloring of graphs ⋮ Chromatic number of \(P_5\)-free graphs: Reed's conjecture ⋮ Graph polynomials and paintability of plane graphs ⋮ A lower bound on the independence number of a graph in terms of degrees and local clique sizes ⋮ On bipartization of cubic graphs by removal of an independent set ⋮ \(\Delta \)-list vertex coloring in linear time ⋮ Some generalizations of theorems on vertex coloring ⋮ Graph homomorphisms into the five-cycle ⋮ List homomorphisms of graphs with bounded degrees ⋮ \([r,s,t\)-colorings of graphs] ⋮ Spectral radii of graphs with given chromatic number ⋮ \([r,s,t\)-chromatic numbers and hereditary properties of graphs] ⋮ Highly irregular m-chromatic graphs ⋮ Recursive coloration of countable graphs ⋮ Inequalities between the domination number and the chromatic number of a graph ⋮ Applications of edge coloring of multigraphs to vertex coloring of graphs ⋮ On constructive methods in the theory of colour-critical graphs ⋮ On the chromatic number of integral circulant graphs ⋮ Independent sets in \(\{\text{claw}, K_4 \}\)-free 4-regular graphs ⋮ Domination and total domination in cubic graphs of large girth ⋮ Finite groups whose prime graphs are regular. ⋮ The complexity of changing colourings with bounded maximum degree ⋮ The \((p,q)\)-total labeling problem for trees ⋮ Graphs with chromatic number close to maximum degree ⋮ Are there any good digraph width measures? ⋮ Equitable \(\Delta\)-coloring of graphs ⋮ Brooks' theorem for generalized dart graphs ⋮ Spectra of uniform hypergraphs ⋮ A matroid analogue of a theorem of Brooks for graphs ⋮ The chromatic number of a signed graph ⋮ Hamiltonian degree conditions which imply a graph is pancyclic ⋮ A comparison of bounds for the chromatic number of a graph ⋮ On graphs with no induced subdivision of \(K_4\) ⋮ Chromatic optimisation: Limitations, objectives, uses, references ⋮ Distributed colorings for collision-free routing in sink-centric sensor networks ⋮ A property tester for tree-likeness of quartet topologies ⋮ Randomly colouring graphs (a combinatorial view) ⋮ Improvement on Brooks' chromatic bound for a class of graphs ⋮ Ore's conjecture on color-critical graphs is almost true ⋮ Colouring graphs when the number of colours is almost the maximum degree ⋮ On degree sums of a triangle-free graph ⋮ Coloring a graph with \(\Delta-1\) colors: conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker ⋮ A unified proof of Brooks' theorem and Catlin's theorem ⋮ The complexity of the empire colouring problem ⋮ The symbiotic relationship of combinatorics and matrix theory ⋮ A nonlinear lower bound on the practical combinational complexity ⋮ Partition into cliques for cubic graphs: Planar case, complexity and approximation ⋮ Supersaturation problem for color-critical graphs ⋮ An introduction to the discharging method via graph coloring ⋮ The complexity of some graph colouring problems ⋮ Degree choosable signed graphs ⋮ Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree ⋮ Characterizing 4-critical graphs with Ore-degree at most seven ⋮ Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number ⋮ Some upper bounds for the product of the domination number and the chromatic number of a graph ⋮ Bounded vertex colorings of graphs ⋮ Covering the cliques of a graph with vertices ⋮ \([r,s,t\)-coloring of trees and bipartite graphs] ⋮ Acyclically 3-colorable planar graphs ⋮ Bounding \(\chi \) in terms of \(\omega \) and \(\varDelta \) for some classes of graphs ⋮ On preserving full orientability of graphs ⋮ Variable neighborhood search for extremal graphs. 22. Extending bounds for independence to upper irredundance ⋮ Some results on Reed's conjecture about \(\omega ,\Delta \), and \(\chi \) with respect to \(\alpha \) ⋮ Grundy number and products of graphs ⋮ Chromatic numbers of infinite graphs ⋮ Excess in critical graphs ⋮ Boundary properties of graphs for algorithmic graph problems ⋮ On the Ramsey numbers for stars versus complete graphs ⋮ Brooks' theorem via the Alon-Tarsi theorem ⋮ Degree bounds for linear discrepancy of interval orders and disconnected posets ⋮ Some simplified NP-complete graph problems ⋮ Rainbow graph splitting ⋮ An extension of Brooks' theorem to n-degenerate graphs ⋮ On graphs whose least eigenvalue exceeds \(-1-\sqrt2\) ⋮ 2-distance vertex-distinguishing index of subcubic graphs ⋮ Covering the vertex set of a graph with subgraphs of smaller degree ⋮ Every graph \(G\) is Hall \(\Delta(G)\)-extendible ⋮ Hadwiger's conjecture for 3-arc graphs ⋮ A bound on the chromatic number of a graph ⋮ A short proof of Catlin's extension of Brooks' theorem ⋮ Edge-coloring of 3-uniform hypergraphs ⋮ The chromatic number of 5-valent circulants ⋮ Chromatic coloring with a maximum color class ⋮ Another bound on the chromatic number of a graph ⋮ Colouring problems ⋮ On the choice number of complete multipartite graphs with part size four ⋮ Approximation algorithm for maximum edge coloring ⋮ \(H\)-coloring degree-bounded (acyclic) digraphs ⋮ Linear time self-stabilizing colorings ⋮ A graph colouring model for assigning a heterogeneous workforce to a given schedule ⋮ On critical subgraphs of colour-critical graphs ⋮ Extension problems with degree bounds ⋮ Precoloring extension for 2-connected graphs with maximum degree three ⋮ On list critical graphs ⋮ Efficient bounds for the stable set, vertex cover and set packing problems ⋮ Independence in graphs with maximum degree four ⋮ Small embeddings of partial directed triple systems and partial triple systems with even \(\lambda\) ⋮ Regular independent sets

This page was built for publication: