On the -ascent chromatic index of complete graphs

DOI10.2140/INVOLVE.2015.8.295MaRDI QIDQ2340199zbMATH OpenOpenAlexFDO

Authors Jean A. Breytenbach, Christina M. Mynhardt

Publication date 16 April 2015

Published in Involve (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2140/involve.2015.8.295

zbMATH Keywords

edge colouringincreasing pathdepressionedge ordering of a graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• Exact values for the \(\varepsilon\)-ascent chromatic index of complete graphs
• Edge colourings and the depression of a graph
• scientific article; zbMATH DE number 2147937
• A class of graphs with depression three
• A lower bound for the depression of trees

Cited in

(3)

• The depression of a graph
• Exact values for the \(\varepsilon\)-ascent chromatic index of complete graphs
• scientific article; zbMATH DE number 2147937 (Why is no real title available?)

This page was built for publication: On the \(\varepsilon\)-ascent chromatic index of complete graphs

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