On the vertex-distinguishing proper edge-colorings of graphs
From MaRDI portal
Publication:1305536
zbMath0932.05036MaRDI QIDQ1305536
Amel Harkat-Benhamdine, Cristina Bazgan, Hao Li
Publication date: 29 November 1999
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Related Items
A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs ⋮ On adjacent-vertex-distinguishing total colourings of powers of cycles, hypercubes and lattice 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 ⋮ Decomposition of Complete Bipartite Even Graphs into Closed Trails ⋮ The edge-distinguishing chromatic number of petal graphs, chorded cycles, and spider graphs ⋮ On the neighbour-distinguishing index of a graph ⋮ \(r\)-strong edge colorings of graphs ⋮ Legally $$(\varDelta +2)$$ ( Δ + 2 ) -Coloring Bipartite Outerplanar Graphs in Cubic Time ⋮ \(D(\beta)\)-vertex-distinguishing total coloring of graphs ⋮ Upper bounds on vertex distinguishing chromatic indices of some Halin graphs ⋮ Point-distinguishing chromatic index of the union of paths ⋮ 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 ⋮ How to personalize the vertices of a graph? ⋮ On the AVDTC of Sierpiński-type graphs ⋮ A note on adjacent strong edge coloring of \(K(n,m)\) ⋮ \(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 ⋮ On the vertex-distinguishing proper edge coloring of composition of complete graph and star ⋮ Balanced edge colorings. ⋮ AVDTC numbers of generalized Halin graphs with maximum degree at least 6 ⋮ Adjacent-vertex-distinguishing proper edge colorings of planar bipartite graphs with \(\Delta=9\), \(10\), or \(11\) ⋮ On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\) ⋮ Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9 ⋮ Edge-distinguishing index of a graph ⋮ 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 ⋮ 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 ⋮ Concise proofs for adjacent vertex-distinguishing total colorings ⋮ An upper bound for the adjacent vertex distinguishing acyclic edge chromatic number of a graph ⋮ AVD-total-colouring of complete equipartite graphs
Cites Work
This page was built for publication: On the vertex-distinguishing proper edge-colorings of graphs
