Vertex-distinguishing proper edge-colorings
From MaRDI portal
Publication:4362092
DOI<73::AID-JGT2>3.0.CO;2-C 10.1002/(SICI)1097-0118(199710)26:2<73::AID-JGT2>3.0.CO;2-CzbMath0886.05068OpenAlexW4255486464MaRDI QIDQ4362092
Anita C. Burris, Richard H. Schelp
Publication date: 7 January 1998
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199710)26:2<73::aid-jgt2>3.0.co;2-c
Related Items
A note on graph proper total colorings with many distinguishing constraints ⋮ Existence and embeddings of partial Steiner triple systems of order ten with cubic leaves ⋮ Kaleidoscopic colorings of graphs ⋮ A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs ⋮ A smallest irregular oriented graph containing a given diregular one ⋮ On adjacent-vertex-distinguishing total colourings of powers of cycles, hypercubes and lattice graphs ⋮ SOME RESULTS ON (p, g,∑)-VALUATION OF GRAPHS ⋮ Adjacent vertex distinguishing total colorings of 2-degenerate graphs ⋮ Vertex-distinguishing proper arc colorings of digraphs ⋮ Adjacent vertex distinguishing total coloring of graphs with maximum degree 4 ⋮ Unnamed Item ⋮ Edge-colorings of 4-regular graphs with the minimum number of palettes ⋮ A note on the neighbour-distinguishing index of digraphs ⋮ Inapproximability of the lid-chromatic number ⋮ On the neighbour-distinguishing index of a graph ⋮ Legally $$(\varDelta +2)$$ ( Δ + 2 ) -Coloring Bipartite Outerplanar Graphs in Cubic Time ⋮ \(D(\beta)\)-vertex-distinguishing total coloring of graphs ⋮ Adjacent vertex-distinguishing edge coloring of graphs with maximum degree \(\Delta\) ⋮ On generalisations of the AVD conjecture to digraphs ⋮ Some results on spanning trees ⋮ Upper bounds on vertex distinguishing chromatic indices of some Halin graphs ⋮ Strong edge colorings of graphs ⋮ Point-distinguishing chromatic index of the union of paths ⋮ Vertex-coloring 2-edge-weighting of graphs ⋮ A Vizing-like theorem for union vertex-distinguishing edge coloring ⋮ Vertex-distinguishing edge colorings of graphs with degree sum conditions ⋮ Arbitrarily large difference between \(d\)-strong chromatic index and its trivial lower bound ⋮ On the adjacent vertex-distinguishing equitable edge coloring of graphs ⋮ A new vertex distinguishing total coloring of trees ⋮ Algorithmic complexity of proper labeling problems ⋮ Locally identifying coloring of graphs with few P4s ⋮ How to personalize the vertices of a graph? ⋮ List-distinguishing Cartesian products of cliques ⋮ The strong chromatic index of Halin graphs ⋮ On the AVDTC of Sierpiński-type graphs ⋮ Locally identifying colourings for graphs with given maximum degree ⋮ A note on adjacent strong edge coloring of \(K(n,m)\) ⋮ Upper bounds for adjacent vertex-distinguishing edge coloring ⋮ The adjacent vertex distinguishing total chromatic number ⋮ On defected colourings of graphs ⋮ Distant total sum distinguishing index of graphs ⋮ \(d\)-strong edge colorings of graphs ⋮ Unnamed Item ⋮ On the adjacent vertex-distinguishing acyclic edge coloring of some graphs ⋮ Gap vertex-distinguishing edge colorings of graphs ⋮ Vertex-distinguishing E-total colorings of graphs ⋮ Harmonious and achromatic colorings of fragmentable hypergraphs ⋮ On the vertex-distinguishing proper edge coloring of composition of complete graph and star ⋮ Balanced edge colorings. ⋮ Locally identifying coloring in bounded expansion classes of graphs ⋮ AVDTC numbers of generalized Halin graphs with maximum degree at least 6 ⋮ New estimates for the gap chromatic number ⋮ On the adjacent-vertex-strongly-distinguishing total coloring of graphs ⋮ Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9 ⋮ Edge-distinguishing index of a graph ⋮ On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\) ⋮ Vertex distinguishing equitable total chromatic number of join graphs ⋮ Relations of vertex distinguishing total chromatic numbers between a subgraph and its supergraph ⋮ Vertex-distinguishing proper edge colourings of some regular graphs ⋮ Harmonious and achromatic colorings of fragmentable hypergraphs ⋮ On adjacent vertex-distinguishing total chromatic number of generalized Mycielski graphs ⋮ On the adjacent vertex distinguishing edge colourings of graphs ⋮ Degree constrained subgraphs ⋮ Vertex colouring edge partitions ⋮ Unnamed Item ⋮ Minimum number of palettes in edge colorings ⋮ On the total proper connection of graphs ⋮ Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree ⋮ Adjacent vertex-distinguishing edge and total chromatic numbers of hypercubes ⋮ The algorithm for adjacent vertex distinguishing proper edge coloring of graphs ⋮ 2-distance vertex-distinguishing index of subcubic graphs ⋮ An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph ⋮ Observability of the extended Fibonacci cubes ⋮ Concise proofs for adjacent vertex-distinguishing total colorings ⋮ An upper bound for the adjacent vertex distinguishing acyclic edge chromatic number of a graph ⋮ Decompositions of pseudographs into closed trails of even sizes ⋮ deBruijn-like sequences and the irregular chromatic number of paths and cycles ⋮ \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number ⋮ General vertex-distinguishing total coloring of graphs ⋮ On the vertex-distinguishing proper edge-colorings of graphs ⋮ AVD-total-colouring of complete equipartite graphs
This page was built for publication: Vertex-distinguishing proper edge-colorings
