scientific article; zbMATH DE number 3284071
From MaRDI portal
Publication:5564127
zbMath0177.52301MaRDI QIDQ5564127
Publication date: 1968
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (only showing first 100 items - show all)
The total coloring of \(K_5\)-minor-free graphs ⋮ Total-colorings of complete multipartite graphs using amalgamations ⋮ Total coloring of planar graphs without chordal 7-cycles ⋮ Chromatic properties of the Pancake graphs ⋮ On the size of edge-chromatic critical graphs ⋮ Grundy domination of forests and the strong product conjecture ⋮ A note on the size of edge-chromatic 4-critical graphs ⋮ On total chromatic number of planar graphs without 4-cycles ⋮ Bounds on the lower size of a 7-critical graph ⋮ Power domination of the Cartesian product of graphs ⋮ The total graph of a hypergraph ⋮ The total chromatic number of any multigraph with maximum degree five is at most seven ⋮ Efficient location of resources in cylindrical networks ⋮ Total chromatic number and some topological indices ⋮ The parameterised complexity of list problems on graphs of bounded treewidth ⋮ Hamiltonian cycles in critical graphs with large maximum degree ⋮ Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles ⋮ List edge and list total colourings of multigraphs ⋮ On edge colorings of 1-toroidal graphs ⋮ Bounds on the 2-rainbow domination number of graphs ⋮ On total coloring of some classes of regular graphs ⋮ The total chromatic number of pseudo-outerplanar graphs ⋮ Coloring, location and domination of corona graphs ⋮ Sizes of critical graphs with small maximum degrees ⋮ Hamiltonicity of edge-chromatic critical graphs ⋮ Total coloring of planar graphs with 7-cycles containing at most two chords ⋮ Lower bounds on the number of edges in edge-chromatic-critical graphs with fixed maximum degrees ⋮ Total chromatic number of generalized Mycielski graphs ⋮ Total coloring of planar graphs without 6-cycles ⋮ Total choosability of planar graphs with maximum degree 4 ⋮ Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable ⋮ Total colorings of \(F_5\)-free planar graphs with maximum degree 8 ⋮ Distance colouring without one cycle length ⋮ \((\Delta + 1)\)-total-colorability of plane graphs with maximum degree \(\Delta\) at least 6 and without adjacent short cycles ⋮ On the average degree of critical graphs with maximum degree six ⋮ The total chromatic number of complete multipartite graphs with low deficiency ⋮ Facial entire colouring of plane graphs ⋮ Total coloring of embedded graphs of maximum degree at least ten ⋮ On the size of edge chromatic critical graphs ⋮ List total colorings of planar graphs without triangles at small distance ⋮ \((\Delta +1)\)-total-colorability of plane graphs of maximum degree \(\Delta\geq 6\) with neither chordal \(5\)-cycle nor chordal \(6\)-cycle ⋮ Total coloring of planar graphs with maximum degree \(7\) ⋮ On the average degree of edge chromatic critical graphs. II. ⋮ Total \(k\)-domination in Cartesian product graphs ⋮ Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles ⋮ Edge coloring of graphs with small average degrees ⋮ Randomly colouring graphs (a combinatorial view) ⋮ Fractional total colourings of graphs of high girth ⋮ Entire colouring of plane graphs ⋮ Total coloring of graphs embedded in surfaces of nonnegative Euler characteristic ⋮ The total chromatic number of nearly complete bipartite graphs ⋮ Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9 ⋮ Total colorings of planar graphs without small cycles ⋮ Graph distance measures based on topological indices revisited ⋮ On the upper total domination number of Cartesian products of graphs ⋮ On Cartesian products having a minimum dominating set that is a box or a stairway ⋮ An introduction to the discharging method via graph coloring ⋮ Fifty years of graph matching, network alignment and network comparison ⋮ Interval edge-colorings of composition of graphs ⋮ A totally \((\Delta + 1)\)-colorable 1-planar graph with girth at least five ⋮ Average degrees of edge-chromatic critical graphs ⋮ A note on the adjacent vertex distinguishing total chromatic number of graphs ⋮ Local condition for planar graphs of maximum degree 7 to be 8-totally colorable ⋮ Adjacent vertex distinguishing total colorings of outerplanar graphs ⋮ Constructing a spanning tree with many leaves ⋮ The average degree of a multigraph critical with respect to edge or total choosability ⋮ Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable ⋮ Rainbow domination on trees ⋮ Note on 2-rainbow domination and Roman domination in graphs ⋮ Some remarks on the chromatic index of a graph ⋮ Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable ⋮ On the size of critical graphs with maximum degree 8 ⋮ Some results on Vizing's conjecture and related problems ⋮ On an upper bound of the graph's chromatic number, depending on the graph's degree and density ⋮ Towards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squares ⋮ Total coloring conjecture for certain classes of graphs ⋮ A comparative analysis of new graph distance measures and graph edit distance ⋮ The structure of totally critical graphs of odd order ⋮ A total-chromatic number analogue of Plantholt's theorem ⋮ Vizing's conjecture for chordal graphs ⋮ On the \(\{k\}\)-domination number of Cartesian products of graphs ⋮ Equitable total coloring of \(C_m\square C_n\) ⋮ On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles ⋮ On the total \(\{k\}\)-domination number of Cartesian products of graphs ⋮ On \((d,1)\)-total numbers of graphs ⋮ An application of Vizing and Vizing-like adjacency lemmas to Vizing's independence number conjecture of edge chromatic critical graphs ⋮ On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles ⋮ The Hall number, the Hall index, and the total Hall number of a graph ⋮ Edge coloring of graphs with small maximum degrees ⋮ Total colorings and list total colorings of planar graphs without intersecting 4-cycles ⋮ Total colorings of equibipartite graphs ⋮ Integer domination of Cartesian product graphs ⋮ Totally critical even order graphs ⋮ Total coloring of planar graphs without some chordal 6-cycles ⋮ On the coequal values of total chromatic number and chromatic index ⋮ Total colouring regular bipartite graphs is NP-hard ⋮ Orientable domination in product-like graphs ⋮ The total chromatic number of regular graphs whose complement is bipartite ⋮ On total colorings of 1-planar graphs ⋮ Simultaneous coloring of edges and faces of plane graphs
This page was built for publication:
