Adjacent vertex-distinguishing edge coloring of graphs with maximum degree

DOI10.1007/S10878-011-9444-9zbMATH Open1276.90079OpenAlexW2156842373MaRDI QIDQ358639FDOQ358639

Authors: Hervé Hocquard, Mickaël Montassier 

Publication date: 9 August 2013

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-011-9444-9

Recommendations

• Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
• Adjacent vertex-distinguishing edge coloring of graphs with maximum degree at least five
• On the adjacent vertex distinguishing edge colourings of graphs
• Adjacent vertex-distinguishing edge coloring of graphs
• Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree
• Vertex-edge adjacent vertex-distinguishing total colorings of some graphs
• On the adjacent vertex-distinguishing acyclic edge coloring of some graphs
• Adjacent vertex distinguishing total colorings of graphs with smaller degrees
• Adjacent vertex-distinguishing acyclic edge coloring of graphs
• Adjacent vertex distinguishing total coloring of graphs with maximum degree 4

zbMATH Keywords

maximum average degreeadjacent vertex-distinguishing edge coloring

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Adjacent strong edge coloring of graphs
• Vertex-distinguishing proper edge-colorings
• Adjacent Vertex Distinguishing Edge‐Colorings
• \(r\)-strong edge colorings of graphs
• The observability of the Fibonacci and the Lucas cubes
• Title not available (Why is that?)
• Strong edge colorings of graphs
• Vertex-distinguishing edge colorings of graphs
• Title not available (Why is that?)
• Asymptotic behaviour of the observability of \(Q_ n\)
• Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree

Cited In (32)

• On the algorithmic complexity of determining the AVD and NSD chromatic indices of graphs
• Neighbor sum distinguishing colorings of graphs with maximum average degree less than \(\frac{37} {12}\)
• On the neighbor sum distinguishing index of planar graphs
• Distant sum distinguishing index of graphs
• Adjacent vertex distinguishing total coloring of graphs with maximum degree 4
• Neighbor sum distinguishing index of sparse graphs
• Adjacent vertex distinguishing edge coloring of planar graphs without 4-cycles
• A characterization on the adjacent vertex distinguishing index of planar graphs with large maximum degree
• A note on asymptotically optimal neighbour sum distinguishing colourings
• Adjacent vertex distinguishing edge choosability of 1-planar graphs with maximum degree at least 23
• Neighbor sum distinguishing edge colorings of graphs with small maximum average degree
• On Neighbor-Distinguishing Index of Planar Graphs
• On the inclusion chromatic index of a graph
• Inclusion total chromatic number
• Adjacent vertex-distinguishing edge coloring of 2-degenerate graphs
• An improved upper bound on the adjacent vertex distinguishing edge chromatic number of a simple graph.
• Maximum \(\Delta \)-edge-colorable subgraphs of class II graphs
• Neighbor sum distinguishing chromatic index of sparse graphs via the combinatorial Nullstellensatz
• Title not available (Why is that?)
• Graphs with multiplicative vertex-coloring 2-edge-weightings
• Adjacent vertex distinguishing indices of planar graphs without 3-cycles
• On the adjacent vertex distinguishing edge chromatic number of graphs.
• Title not available (Why is that?)
• Some bounds on the neighbor-distinguishing index of graphs
• On the adjacent vertex distinguishing edge colourings of graphs
• Adjacent vertex distinguishing colorings by sum of sparse graphs
• On the neighbour sum distinguishing index of graphs with bounded maximum average degree
• Upper bounds for adjacent vertex-distinguishing edge coloring
• Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
• Adjacent vertex distinguishing edge coloring of planar graphs without 3-cycles
• Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs
• An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph

This page was built for publication: Adjacent vertex-distinguishing edge coloring of graphs with maximum degree \(\Delta\)

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