Good edge-labelling of graphs

DOI10.1016/J.ENDM.2009.11.045MaRDI QIDQ5891094zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

planar graphschannel assignmentmatching-cutedge-labelling

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 3869366 (Why is no real title available?)
• scientific article; zbMATH DE number 1250667 (Why is no real title available?)
• A characterization of extremal graphs with no matching-cut
• Good edge-labelling of graphs
• New asymptotics for bipartite Turán numbers
• The complexity of satisfiability problems

Cited in

(5)

• Directed acyclic graphs with the unique dipath property
• scientific article; zbMATH DE number 6605161 (Why is no real title available?)
• On the density of nearly regular graphs with a good edge-labeling
• Good edge-labelling of graphs
• 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)