scientific article; zbMATH DE number 3616457

From MaRDI portal
Publication:4180377

zbMath0397.05023MaRDI QIDQ4180377

Michael Burstein

Publication date: 1979


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



Related Items

Acyclic choosability of graphs with bounded degreeAcyclically 4-colorable triangulationsImproved bounds on the generalized acyclic chromatic numberAcyclic colorings of subcubic graphsAcyclic colorings of graphs with bounded degreeAnalysis of a heuristic for acyclic edge colouringAcyclic coloring of graphs of maximum degree five: nine colors are enoughThe acircuitic directed star arboricity of subcubic graphs is at most fourAcyclic coloring of graphs with maximum degree 7Acyclic coloring of claw-free graphs with small degreeAcyclic edge coloring of planar graphs without small cyclesAcyclic coloring with few division verticesAcyclic chromatic index of chordless graphsImproved upper bounds on acyclic edge coloringsAcyclic vertex coloring of graphs of maximum degree 5Hardness transitions and uniqueness of acyclic colouringGraphs with maximum degree \(6\) are acyclically \(11\)-colorableAcyclic edge coloring of planar graphs with \(\varDelta\) colorsThe method of coloring in graphs and its applicationAcyclic edge coloring of graphsA survey of graph coloring - its types, methods and applicationsAcyclic vertex coloring of graphs of maximum degree sixImproved bounds on acyclic edge colouringOn acyclic edge-coloring of the complete bipartite graphs \(K_{2p-1, 2p-1}\) for odd prime \(p\)Optimal acyclic edge‐coloring of cubic graphsOptimal acyclic edge colouring of grid like graphsAcyclic improper colouring of graphs with maximum degree 4Acyclic \(L\)-coloring of graphs with maximum degrees 5 and 6A polyhedral study of the acyclic coloring problemOn acyclic edge-coloring of complete bipartite graphsAcyclic edge coloring of subcubic graphsAcyclic coloring of graphs and entropy compression methodAcyclic and \(k\)-distance coloring of the gridAcyclic edge coloring of planar graphs with large girthAcyclic Vertex Coloring of Graphs of Maximum Degree SixAcyclic coloring of graphs with maximum degree at most sixA note on acyclic edge coloring of complete bipartite graphsMinimum feedback vertex set and acyclic coloring.The \(r\)-acyclic chromatic number of planar graphs