An anti-Ramsey theorem of k-restricted edge-cuts

DOI10.1007/S00373-022-02519-6MaRDI QIDQ2159228zbMATH OpenOpenAlexWikidataFDO

Authors Juan José Montellano-Ballesteros, Diego González-Moreno, Mucuy-kak Guevara

Publication date 28 July 2022

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-022-02519-6

zbMATH Keywords

rainbowheterochromatic\(k\)-restricted edge-cutedge-coloring graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Recommendations

• An anti-Ramsey Theorem on edge-cutsets
• A proof of an inequality concerning \(k\)-restricted edge connectivity
• Edges of degree \(k\) in minimally restricted \(k\)-edge connected graphs
• Sufficient conditions for k-restricted edge connected graphs
• k-restricted edge connectivity in (p+1)-clique-free graphs

Cites work

• scientific article; zbMATH DE number 3494450 (Why is no real title available?)
• An anti-Ramsey Theorem on edge-cutsets
• An anti-Ramsey theorem
• Extraconnectivity of graphs with large girth
• On restricted colourings of \(K_ n\)
• On the extraconnectivity of graphs

Cited in

(2)

• An anti-Ramsey Theorem on edge-cutsets
• An extended study of k-restricted edge connectivity: Another approach to Tait’s coloring theorem

This page was built for publication: An anti-Ramsey theorem of \(k\)-restricted edge-cuts

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