Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
scientific article; zbMATH DE number 3265667 - MaRDI portal

scientific article; zbMATH DE number 3265667

From MaRDI portal
Publication:5552096

zbMath0165.57302MaRDI QIDQ5552096

Florica Kramer, Horst Kramer

Publication date: 1969


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



Related Items (33)

Chromatic numbers of exact distance graphsOn the parameter \(v_ 2(h)\) for \(L_ 2\)-coloured graphs2-distance list \((\Delta +2)\)-coloring of planar graphs with girth at least 10BCH codes and distance multi- or fractional colorings in hypercubes asymptoticallyExact square coloring of subcubic planar graphsGraph \(r\)-hued colorings -- a surveyExact square coloring of certain classes of graphs: complexity and algorithmsLOCALLY-BALANCED $k$-PARTITIONS OF GRAPHS2-distance, injective, and exact square list-coloring of planar graphs with maximum degree 4Brève communication. Sur le nombre chromatique $K(p, G)$ des graphesExact square coloring of graphs resulting from some graph operations and productsThe square chromatic number of the torusColoring squares of planar graphs with maximum degree at most fiveInjective coloring of graphs revisited\(L(p,q)\)-labeling of sparse graphs2-distance colorings of integer distance graphsOn the strong chromatic index of cyclic multigraphs\(r\)-hued \((r+1)\)-coloring of planar graphs with girth at least 8 for \(r\geq 9\)Tree-like distance colouring for planar graphs of sufficient girthA survey on the distance-colouring of graphsRado's Selection Principle: Applications to binary relations, graph and hypergraph colorings and partially ordered setsOn small graphs with highly imperfect powersOn colorings of graph fractional powersColoring squares of graphs with mad constraintsGraph theoryThe \(k\)-distance chromatic number of trees and cyclesThe distance coloring of graphsColouring exact distance graphs of chordal graphsThe subchromatic number of a graph2-distance list \((\varDelta +3)\)-coloring of sparse graphsFurther results on 2-distance coloring of graphs2-distance colorings of some direct products of paths and cyclesOn d-distance equitable chromatic number of some graphs




This page was built for publication: