scientific article; zbMATH DE number 3284071

Cited in

(only showing first 100 items - show all)

Vizing's conjecture for chordal graphs
On the \(\{k\}\)-domination number of Cartesian products of graphs
Equitable total coloring of C_m 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
Edge coloring of graphs with small maximum degrees
Total colorings and list total colorings of planar graphs without intersecting 4-cycles
The total chromatic number of nearly complete bipartite graphs
On an upper bound of the graph's chromatic number, depending on the graph's degree and density
The Hall number, the Hall index, and the total Hall number of a graph
Total colorings of equibipartite graphs
Totally critical even order graphs
Total colouring regular bipartite graphs is NP-hard
The total chromatic number of regular graphs whose complement is bipartite
Simultaneous coloring of edges and faces of plane graphs
On the size of edge-chromatic critical graphs
The total graph of a hypergraph
The total chromatic number of any multigraph with maximum degree five is at most seven
List edge and list total colourings of multigraphs
The total chromatic number of pseudo-outerplanar graphs
On the size of edge chromatic critical graphs
Edge coloring of graphs with small average degrees
Efficient location of resources in cylindrical networks
Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles
Distance colouring without one cycle length
Total \(k\)-domination in Cartesian product graphs
Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9
A note on the adjacent vertex distinguishing total chromatic number of graphs
The structure of totally critical graphs of odd order
Bounds on the lower size of a 7-critical graph
Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable
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
Fifty years of graph matching, network alignment and network comparison
Average degrees of edge-chromatic critical graphs
Towards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squares
On the coequal values of total chromatic number and chromatic index
Orientable domination in product-like graphs
The total coloring of \(K_5\)-minor-free graphs
On total coloring of some classes of regular graphs
On the average degree of edge chromatic critical graphs. II.
Constructing a spanning tree with many leaves
Some remarks on the chromatic index of a graph
Total coloring conjecture for certain classes of graphs
A comparative analysis of new graph distance measures and graph edit distance
Integer domination of Cartesian product graphs
Total coloring of planar graphs without some chordal 6-cycles
On total colorings of 1-planar graphs
Chromatic properties of the Pancake graphs
On total chromatic number of planar graphs without 4-cycles
Asymptotically optimal neighbor sum distinguishing total colorings of graphs
Finding \(\Delta (\Sigma)\) for a surface \(\Sigma \) of characteristic \(-6\) and \(-7\)
Vizing's 2-factor conjecture involving toughness and maximum degree conditions
Relations between edge removing and edge subdivision concerning domination number of a graph
Sketchy tweets: ten minute conjectures in graph theory
Total colorings of planar graphs with sparse triangles
A note on list edge and list total coloring of planar graphs without adjacent short cycles
Rainbow domination and related problems on strongly chordal graphs
Alliance free sets in Cartesian product graphs
Total colorings of planar graphs without chordal 6-cycles
A sufficient condition for planar graphs with maximum degree 8 to be 9-totally colorable
On the 2-rainbow domination in graphs
The average degree of an edge-chromatic critical graph
Semi-total graph colourings, the beta parameter, and total chromatic number
A note on Vizing's independence number conjecture of edge chromatic critical graphs
The domination number of \(K_n^3\)
Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs
Über den Zusammenhang symmetrischer Graphen
The total chromatic number of regular graphs of even order and high degree
Stack domination density
The 2-domination number of cylindrical graphs
Total-colorings of complete multipartite graphs using amalgamations
Total coloring of planar graphs without chordal 7-cycles
Coloring powers and girth
A characterization of graphs with fractional total chromatic number equal to \(\Delta +2\)
Fractionally edge colouring graphs with large maximum degree in linear time
A note on the size of edge-chromatic 4-critical graphs
Power domination of the Cartesian product of graphs
Total chromatic number and some topological indices
Domination in digraphs
Multiple domination
Distance domination in graphs
(Open) packing number of some graph products
The parameterised complexity of list problems on graphs of bounded treewidth
Hamiltonian cycles in critical graphs with large maximum degree
Paired-domination of Cartesian products of graphs and rainbow domination
On edge colorings of 1-toroidal graphs
Bounds on the 2-rainbow domination number of graphs
Coloring, location and domination of corona 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 colorings of F₅-free planar graphs with maximum degree 8
( + 1)-total-colorability of plane graphs with maximum degree at least 6 and without adjacent short cycles
On the average degree of critical graphs with maximum degree six
Coloring 3-power of 3-subdivision of subcubic graph

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5564127)