Affine optimal k-proper connected edge colorings

DOI10.1007/S11590-024-02111-2MaRDI QIDQ6968773zbMATH OpenFDO

Authors Robert D. Barish, Tetsuo Shibuya

Publication date 24 June 2025

Published in Optimization Letters (Search for Journal in Brave)

Copyright license File:Creative commons license with attribution.png Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S11590-024-02111-2

zbMATH Keywords

approximation hardnessedge coloringFPRASoptimal proper connection numberoptimization hardnessproper connection

Mathematics Subject Classification ID

General logic (03Bxx) Graph theory (05Cxx) Mathematical programming (90Cxx)

Cites work

• \(T\)-colorings of graphs: recent results and open problems
• APPLICATION OF THE GRAPH COLORING ALGORITHM TO THE FREQUENCY ASSIGNMENT PROBLEM
• Chromatic scheduling and frequency assignment
• Easy problems for tree-decomposable graphs
• Frequency planning and ramifications of coloring
• Graph Structure and Monadic Second-Order Logic: Language Theoretical Aspects
• Graph theory with applications
• scientific article; zbMATH DE number 1059243 (Why is no real title available?)
• Models and solution techniques for frequency assignment problems
• Monte-Carlo algorithms for the planar multiterminal network reliability problem
• Nonhamiltonian 3-Connected Cubic Planar Graphs
• On proper-path colorings in graphs
• On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
• Optimal proper connection of graphs
• Parameterized algorithms
• Proper connection of graphs
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• The monadic second-order logic of graphs. XII: Planar graphs and planar maps
• The Planar Hamiltonian Circuit Problem is NP-Complete

This page was built for publication: Affine optimal \(k\)-proper connected edge colorings

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