scientific article; zbMATH DE number 907924
From MaRDI portal
Publication:4886768
zbMath0853.05040MaRDI QIDQ4886768
Mirko Horňák, Ján Černý, Roman Soták
Publication date: 9 December 1996
Full work available at URL: https://eudml.org/doc/34424
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (34)
Kaleidoscopic colorings of graphs ⋮ A smallest irregular oriented graph containing a given diregular one ⋮ Adjacent vertex distinguishing total coloring of graphs with maximum degree 4 ⋮ Decomposition of Complete Bipartite Even Graphs into Closed Trails ⋮ A note on the neighbour-distinguishing index of digraphs ⋮ Inapproximability of the lid-chromatic number ⋮ On the neighbour-distinguishing index of a graph ⋮ Adjacent vertex-distinguishing edge coloring of graphs with maximum degree \(\Delta\) ⋮ On generalisations of the AVD conjecture to digraphs ⋮ Asymptotic behaviour of the observability of \(Q_ n\) ⋮ Vertex-distinguishing edge colorings of graphs with degree sum conditions ⋮ Arbitrarily large difference between \(d\)-strong chromatic index and its trivial lower bound ⋮ A new vertex distinguishing total coloring of trees ⋮ Locally identifying coloring of graphs with few P4s ⋮ How to personalize the vertices of a graph? ⋮ Locally identifying colourings for graphs with given maximum degree ⋮ Upper bounds for adjacent vertex-distinguishing edge coloring ⋮ The adjacent vertex distinguishing total chromatic number ⋮ Distant total sum distinguishing index of graphs ⋮ \(d\)-strong edge colorings of graphs ⋮ Gap vertex-distinguishing edge colorings of graphs ⋮ Balanced edge colorings. ⋮ Locally identifying coloring in bounded expansion classes of graphs ⋮ Edge-distinguishing index of a graph ⋮ Relations of vertex distinguishing total chromatic numbers between a subgraph and its supergraph ⋮ Vertex-distinguishing proper edge colourings of some regular graphs ⋮ Unnamed Item ⋮ Minimum number of palettes in edge colorings ⋮ Adjacent vertex-distinguishing edge and total chromatic numbers of hypercubes ⋮ An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph ⋮ Observability of the extended Fibonacci cubes ⋮ Adjacent strong edge colorings and total colorings of regular graphs ⋮ Decompositions of pseudographs into closed trails of even sizes ⋮ On the vertex-distinguishing proper edge-colorings of graphs
Cites Work
This page was built for publication:
