scientific article; zbMATH DE number 3273761
From MaRDI portal
Publication:5558480
zbMath0171.44902MaRDI QIDQ5558480
Publication date: 1965
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (only showing first 100 items - show all)
Total coloring of 1-toroidal graphs with maximum degree at least 11 and no adjacent triangles ⋮ On the size of edge-chromatic critical graphs ⋮ Hadwiger's conjecture for line graphs ⋮ A sufficient condition for edge 6-colorable planar graphs with maximum degree 6 ⋮ A \(\Delta\)-subgraph condition for a graph to be class 1 ⋮ \((d,1)\)-total labelling of planar graphs with large girth and high maximum degree ⋮ A note on the size of edge-chromatic 4-critical graphs ⋮ Recent progress on edge-colouring graphs ⋮ An improvement to the Hilton-Zhao vertex-splitting conjecture ⋮ Face-degree bounds for planar critical graphs ⋮ The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems ⋮ Facial packing edge-coloring of plane graphs ⋮ A self-stabilizing \((\Delta +4)\)-edge-coloring algorithm for planar graphs in anonymous uniform systems ⋮ There are no edge-chromatic 4-critical graphs of order 12 ⋮ Subcubic planar graphs of girth 7 are class I ⋮ The chromatic index of graphs of high maximum degree ⋮ Generalized coloring for tree-like graphs ⋮ On Vizing's theorem, adjacency lemma and fan argument generalized to multigraphs ⋮ Vertex-splitting and chromatic index critical graphs ⋮ Hamiltonian cycles in critical graphs with large maximum degree ⋮ List edge and list total colourings of multigraphs ⋮ Extension from precoloured sets of edges ⋮ Edge coloring of graphs embedded in a surface of nonnegative characteristic ⋮ Facially-constrained colorings of plane graphs: a survey ⋮ Chromatic index of dense quasirandom graphs ⋮ On the size of graphs of class 2 whose cores have maximum degree two ⋮ On the precise value of the strong chromatic index of a planar graph with a large girth ⋮ Generalised acyclic edge colourings of graphs with large girth ⋮ Finding \(\Delta (\Sigma)\) for a surface \(\Sigma \) of characteristic \(-6\) and \(-7\) ⋮ Edge coloring of planar graphs which any two short cycles are adjacent at most once ⋮ Hamiltonicity of edge-chromatic critical graphs ⋮ Disconnected \(g_c\)-critical graphs ⋮ Edge-colouring graphs with bounded local degree sums ⋮ The structure of plane graphs with independent crossings and its applications to coloring problems ⋮ The \((p,q)\)-total labeling problem for trees ⋮ Edge-chromatic numbers of Mycielski graphs ⋮ On edge colorings of 1-planar graphs without adjacent triangles ⋮ Facial entire colouring of plane graphs ⋮ On the size of edge chromatic critical graphs ⋮ Coloring edges of graphs embedded in a surface of characteristic zero. ⋮ Acyclic edge coloring of planar graphs with \(\varDelta\) colors ⋮ On the average degree of edge chromatic critical graphs. II. ⋮ Some criteria for a graph to be class 1 ⋮ Edge coloring of graphs with small average degrees ⋮ On graphs critical with respect to edge-colourings ⋮ A survey on the cyclic coloring and its relaxations ⋮ Coverings of cubic graphs and 3-edge colorability ⋮ On edge colorings of 1-planar graphs without 5-cycles with two chords ⋮ Randomly colouring graphs (a combinatorial view) ⋮ Balanced edge colorings. ⋮ Entire colouring of plane graphs ⋮ On the average degree of edge chromatic critical graphs ⋮ Strong edge-colouring of sparse planar graphs ⋮ On minimally circular-imperfect graphs ⋮ Finding the exact bound of the maximum degrees of class two graphs embeddable in a surface of characteristic \(\epsilon \in \{-1, -2, -3\}\) ⋮ Reducing Vizing's 2-factor conjecture to Meredith extension of critical graphs ⋮ Some sufficient conditions for 1-planar graphs to be class 1 ⋮ Graph edge coloring: a survey ⋮ On the size of special class 1 graphs and \((P_3;k)\)-co-critical graphs ⋮ The complexity of counting edge colorings for simple graphs ⋮ Tree-like distance colouring for planar graphs of sufficient girth ⋮ Facial edge ranking of plane graphs ⋮ An adjacency Lemma for critical multigraphs ⋮ An improved upper bound on the linear 2-arboricity of planar graphs ⋮ An introduction to the discharging method via graph coloring ⋮ Acyclic edge coloring through the Lovász local lemma ⋮ The chromatic index of a graph whose core has maximum degree two ⋮ Precoloring extension. I: Interval graphs ⋮ Edge colouring by total labellings ⋮ \([r,s,t\)-coloring of trees and bipartite graphs] ⋮ Average degrees of edge-chromatic critical graphs ⋮ Graph edge colouring: Tashkinov trees and Goldberg's conjecture ⋮ On critical graphs with chromatic index 4 ⋮ On the chromatic index of outerplanar graphs ⋮ Chromatic index of graphs with no cycle with a unique chord ⋮ Note to the paper of Grünbaum on acyclic colorings ⋮ Planar graphs with maximum degree \(\Delta \geq 9\) are \((\Delta +1)\)-edge-choosable--a short proof ⋮ The edge colorings of \(K_5\)-minor free graphs ⋮ On small graphs critical with respect to edge colourings ⋮ On the \(\Delta\)-subgraph of graphs which are critical with respect to the chromatic index ⋮ On the chromatic index of almost all graphs ⋮ Edge covered critical multigraphs ⋮ On the size of edge-coloring critical graphs with maximum degree 4 ⋮ Upper bounds on the maximum degree of class two graphs on surfaces ⋮ Lower bounds on the cover-index of a graph ⋮ The chromatic index of a graph whose core is a cycle of order at most 13 ⋮ The edge version of Hadwiger's conjecture ⋮ A sufficient condition for an IC-planar graph to be class 1 ⋮ The edge-face coloring of graphs embedded in a surface of characteristic zero ⋮ Facial visibility in edge colored plane graphs ⋮ An application of Vizing and Vizing-like adjacency lemmas to Vizing's independence number conjecture of edge chromatic critical graphs ⋮ On the chromatic forcing number of a random graph ⋮ On Vizing's bound for the chromatic index of a multigraph ⋮ Chromatic index critical graphs of order 9 ⋮ Edge colorings of graphs embeddable in a surface of low genus ⋮ Edge-partition and star chromatic index ⋮ Planar graphs of maximum degree seven are Class I ⋮ On the coequal values of total chromatic number and chromatic index ⋮ A new method of proving theorems on chromatic index ⋮ The chromatic index of a claw-free graph whose core has maximum degree 2
This page was built for publication:
