Publication:4168628

From MaRDI portal


zbMath0388.05015MaRDI QIDQ4168628

Jozef Fiamčik

Publication date: 1978

Full work available at URL: https://eudml.org/doc/34025


05C15: Coloring of graphs and hypergraphs


Related Items

Acyclic Edge Coloring of Triangle‐Free Planar Graphs, d‐Regular graphs of acyclic chromatic index at least d+2, Improved bounds on the generalized acyclic chromatic number, New bounds for the acyclic chromatic index, Improved upper bounds on acyclic edge colorings, Some results on acyclic edge coloring of plane graphs, On acyclic edge coloring of planar graphs without intersecting triangles, Acyclic edge coloring of planar graphs without 5-cycles, Acyclic edge coloring of planar graphs with \(\varDelta\) colors, Acyclic edge colouring of plane graphs, Acyclic chromatic indices of fully subdivided graphs, Acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 6-cycle, On acyclic edge-coloring of the complete bipartite graphs \(K_{2p-1, 2p-1}\) for odd prime \(p\), Acyclic edge coloring through the Lovász local lemma, Graph theory (algorithmic, algebraic, and metric problems), On acyclic edge-coloring of complete bipartite graphs, Acyclic edge coloring of triangle-free 1-planar graphs, Further result on acyclic chromatic index of planar graphs, About acyclic edge colourings of planar graphs, Acyclic edge coloring of 4-regular graphs without 3-cycles, Generalized arboricity of graphs with large girth, Acyclic edge coloring of sparse graphs, On acyclic edge coloring of toroidal graphs, Acyclic edge coloring of planar graphs without 4-cycles, Improved upper bound for acyclic chromatic index of planar graphs without 4-cycles, The local cut lemma, Acyclic chromatic index of triangle-free 1-planar graphs, Acyclic edge coloring of graphs, The acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 4-cycle, Acyclic edge-coloring using entropy compression, Acyclic edge coloring of planar graphs without adjacent cycles, Acyclic edge coloring of 2-degenerate graphs, Acyclic edge coloring of graphs with maximum degree 4