An extended study of k-restricted edge connectivity: Another approach to Tait’s coloring theorem

DOI10.1142/S1793830922500896zbMATH Open1516.05072OpenAlexW4225151047WikidataQ113775972 ScholiaQ113775972MaRDI QIDQ6132235FDOQ6132235

Authors: G. Suresh Singh 

Publication date: 14 July 2023

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830922500896

Recommendations

• An anti-Ramsey theorem of \(k\)-restricted edge-cuts
• On restricted edge-connectivity of graphs.
• Sufficient conditions for restricted-edge-connectivity to be optimal
• Sufficient conditions for \(k\)-restricted edge connected graphs
• Edges of degree \(k\) in minimally restricted \(k\)-edge connected graphs

zbMATH Keywords

\(k\)-restricted edge connectivityedge cutfour color conjectureproperty restricted edge connectivityTait's coloring theorem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Cites Work

• Graph theory
• A proof of an inequality concerning \(k\)-restricted edge connectivity
• On restricted edge-connectivity of graphs.
• Graph theory

This page was built for publication: An extended study of k-restricted edge connectivity: Another approach to Tait’s coloring theorem

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