Vertex distinguishing colorings of graphs with \(\Delta(G)=2\)

DOI10.1016/S0012-365X(01)00287-4zbMath1005.05019OpenAlexW2086254763MaRDI QIDQ1613483

Béla Bollobás, Paul N. Balister, Richard H. Schelp

Publication date: 29 August 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(01)00287-4

zbMATH Keywords

paths and cyclesedge-color

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items (35)

A note on graph proper total colorings with many distinguishing constraints ⋮ 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 ⋮ 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 ⋮ 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 ⋮ On the adjacent vertex-distinguishing equitable edge coloring of graphs ⋮ A new vertex distinguishing total coloring of trees ⋮ On the AVDTC of Sierpiński-type graphs ⋮ A note on adjacent strong edge coloring of \(K(n,m)\) ⋮ On defected colourings of graphs ⋮ Unnamed Item ⋮ On the adjacent vertex-distinguishing acyclic edge coloring of some graphs ⋮ Vertex-distinguishing E-total colorings of graphs ⋮ Balanced edge colorings. ⋮ AVDTC numbers of generalized Halin graphs with maximum degree at least 6 ⋮ On the adjacent-vertex-strongly-distinguishing total coloring of graphs ⋮ Adjacent-vertex-distinguishing proper edge colorings of planar bipartite graphs with \(\Delta=9\), \(10\), or \(11\) ⋮ Edge-distinguishing index of a graph ⋮ On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\) ⋮ Relations of vertex distinguishing total chromatic numbers between a subgraph and its supergraph ⋮ On planar graphs arbitrarily decomposable into closed trails ⋮ On the AVDTC of 4-regular graphs ⋮ 2-distance vertex-distinguishing index of subcubic graphs ⋮ An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph ⋮ Arbitrary decompositions into open and closed trails ⋮ 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 ⋮ AVD-total-colouring of complete equipartite graphs

This page was built for publication: Vertex distinguishing colorings of graphs with \(\Delta(G)=2\)