Good edge-labelling of graphs

DOI10.1016/J.ENDM.2009.11.045zbMATH Open1268.05173OpenAlexW2005126726MaRDI QIDQ5891094FDOQ5891094

Authors: Júlio Araújo, Nathann Cohen, F. Giroire, Frédéric Havet 

Publication date: 19 July 2013

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

Full work available at URL: https://doi.org/10.1016/j.endm.2009.11.045

Recommendations

• Good edge-labelling of graphs
• On the density of nearly regular graphs with a good edge-labeling
• On gap-labellings of some families of graphs
• Edge colouring by total labellings
• Labelling Graphs with a Condition at Distance 2

zbMATH Keywords

planar graphschannel assignmentmatching-cutedge-labelling

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• The complexity of satisfiability problems
• Title not available (Why is that?)
• New asymptotics for bipartite Turán numbers
• Good edge-labelling of graphs
• Title not available (Why is that?)
• A characterization of extremal graphs with no matching-cut

Cited In (5)

• Directed acyclic graphs with the unique dipath property
• Good edge-labelling of graphs
• On the density of nearly regular graphs with a good edge-labeling
• Title not available (Why is that?)
• Good edge-labelling of graphs

This page was built for publication: Good edge-labelling of graphs

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