SOME UNSOLVED PROBLEMS IN GRAPH THEORY
From MaRDI portal
Publication:5587729
DOI10.1070/RM1968v023n06ABEH001252zbMath0192.60502OpenAlexW2058462653MaRDI QIDQ5587729
Publication date: 1968
Published in: Russian Mathematical Surveys (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1070/rm1968v023n06abeh001252
Related Items
On the 2-domination Number of Cylinders with Small Cycles, TOTAL COLORING OF CERTAIN GRAPHS, REMARKS ON EDGE CRITICAL GRAPHS WITH MAXIMUM DEGREE OF 3 AND 4, A Sufficient Condition for Edge Chromatic Critical Graphs to Be Hamiltonian—An Approach to Vizing's 2‐Factor Conjecture, Cartesian product graphs and k-tuple total domination, Categorifying connected domination via graph überhomology, Signed planar graphs with \(\Delta \geq 8\) are \(\Delta\)-edge-colorable, Bounds On $(t,r)$ Broadcast Domination of $n$-Dimensional Grids, The average degree of edge chromatic critical graphs with maximum degree seven, Unimodality and monotonic portions of certain domination polynomials, Total coloring of planar graphs without some adjacent cycles, Weakening total coloring conjecture and Hadwiger's conjecture on total graphs, On a recolouring version of Hadwiger's conjecture, Total \(k\)-domination in Cartesian product of complete graphs, Total coloring conjecture on certain classes of product graphs, On triangle-free list assignments, Unnamed Item, Unnamed Item, Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz, Total coloring of the prismatic graphs, A brief history of edge-colorings – with personal reminiscences, Total colorings of certain classes of lexicographic product graphs, Total coloring of quasi-line graphs and inflated graphs, On the total coloring of generalized Petersen graphs, Total coloring of planar graphs without short cycles, Equitable total chromatic number of \(K_{r \times p}\) for \(p\) even, Unnamed Item, Edge-face coloring of plane graphs with maximum degree nine, Graph products of the trivariate total domination polynomial and related polynomials, Distant set distinguishing total colourings of graphs, Finding Δ(Σ) for a surface σ of characteristic χ(Σ) = −5, On group choosability of total graphs, Generalization of two results of Hilton on total-colourings of a graph, A note on the minimum total coloring of planar graphs, Total coloring of certain classes of product graphs, Total coloring of claw-free planar graphs, Solution of Vizing's Problem on Interchanges for the case of Graphs with Maximum Degree 4 and Related Results, Optimal Steiner trees under node and edge privacy conflicts, Adjacency Labeling Schemes and Induced-Universal Graphs, Recognizing Cartesian products in linear time, A new framework to approach Vizing's conjecture, Fractional matchings, component-factors and edge-chromatic critical graphs, On total colorings of some special 1-planar graphs, Total chromatic number of regular graphs of odd order and high degree, Extending fixed vertex-colourings to total colourings, Determining equitable total chromatic number for infinite classes of complete \(r\)-partite graphs, On the size of edge chromatic 5-critical graphs, Total coloring of planar graphs without adjacent chordal 6-cycles, Total coloring of outer-1-planar graphs with near-independent crossings, Equitable total coloring of complete $r$-partite $p$-balanced graphs, A sufficient condition for planar graphs of maximum degree 6 to be totally 7-colorable, Edge coloring of signed graphs, Laplacian distribution and domination, The Ramsey number R(3, t) has order of magnitude t2/log t, On the total choosability of planar graphs and of sparse graphs, On Vizing's edge colouring question, The \((p,q)\)-total labeling problem for trees, On edge colorings of 1-planar graphs without adjacent triangles, The list edge coloring and list total coloring of planar graphs with maximum degree at least 7, Vizing's adjacency lemma on edge chromatic critical signed graphs and its applications, The total chromatic number of graphs of even order and high degree, An upper bound on the number of edges of edge-coloring critical graphs with high maximum degree, (\( \Delta + 1\))-total choosability of planar graphs with no cycles of length from 4 to \(k\) and without close triangles, Minimum total coloring of planar graphs with maximum degree 8, Total coloring of rooted path graphs, The adjacent vertex distinguishing total chromatic number, Optimal induced universal graphs for bounded-degree graphs, Some remarks on a paper by Vizing on critical graphs, A tight upper bound on the (\(2,1\))-total labeling number of outerplanar graphs, On graphs critical with respect to edge-colourings, A note on asymptotically optimal neighbour sum distinguishing colourings, On edge colorings of 1-planar graphs without 5-cycles with two chords, Total coloring conjecture for vertex, edge and neighborhood corona products of graphs, Induced Universal Hypergraphs, Finding the exact bound of the maximum degrees of class two graphs embeddable in a surface of characteristic \(\epsilon \in \{-1, -2, -3\}\), Graph edge coloring: a survey, The (2,1)-Total Labeling Number of Outerplanar Graphs Is at Most Δ + 2, On the size of special class 1 graphs and \((P_3;k)\)-co-critical graphs, On \((p, 1)\)-total labelling of NIC-planar graphs, Total colorings of product graphs, Total-coloring of sparse graphs with maximum degree 6, The total chromatic number of graphs having large maximum degree, An upper bound for total colouring of graphs, Asymptotically optimal induced universal graphs, Total equitable list coloring, On critical graphs with chromatic index 4, Improving the Clark-Suen bound on the domination number of the Cartesian product of graphs, The edge colorings of \(K_5\)-minor free graphs, Near-optimal list colorings, Italian domination in the Cartesian product of paths, Vizing's coloring algorithm and the fan number, The size of edge chromatic critical graphs with maximum degree 6, Total coloring of planar graphs of maximum degree eight, A sufficient condition for planar graphs with maximum degree 6 to be totally 8-colorable, On the independence number of edge chromatic critical graphs, On the size of edge-coloring critical graphs with maximum degree 4, Upper bounds on the maximum degree of class two graphs on surfaces, List Edge-Coloring and Total Coloring in Graphs of Low Treewidth, Tightness of domination inequalities for direct product graphs, On the total and AVD-total coloring of graphs, Total coloring of outer-1-planar graphs: the cold case, Generalized fractional total colorings of graphs, On the total neighbour sum distinguishing index of graphs with bounded maximum average degree, On list equitable total colorings of the generalized theta graph, The total coloring of a multigraph with maximal degree 4, The independence number of an edge-chromatic critical graph, Paired Domination in Graphs, Rainbow Domination in Graphs, Independent sets and 2‐factors in edge‐chromatic‐critical graphs, 3-tuple total domination number of Rook's graphs, A new upper bound for the independence number of edge chromatic critical graphs, Finding Δ(Σ) for a Surface Σ of Characteristic −4, Vizing's conjecture: a survey and recent results, The total chromatic number of regular graphs of high degree, Total colorings of planar graphs with maximum degree at least 8, The chromatic index of graphs with large maximum degree, A new upper bound for total colourings of graphs, Total chromatic number of graphs of odd order and high degree, General vertex-distinguishing total coloring of graphs, Distributed coloring algorithms for triangle-free graphs, Not necessarily proper total colourings which are adjacent vertex distinguishing, Recent developments in total colouring, Total Colourings of Direct Product Graphs
