Academic Journal

Upper Bounds on the Average Number of Colors in the Non-equivalent Colorings of a Graph

التفاصيل البيبلوغرافية
العنوان: Upper Bounds on the Average Number of Colors in the Non-equivalent Colorings of a Graph
المؤلفون: Hertz, Alain, Mélot, Hadrien, Bonte, Sébastien, Devillez, Gauvain, Hauweele, Pierre
المساهمون: S825 - Algorithmique, Complexys, Infortech
المصدر: Graphs and Combinatorics, 39 (49) (2023-04-15)
بيانات النشر: Springer
سنة النشر: 2023
مصطلحات موضوعية: Average number of colors, Graph coloring, Graphical Bell numbers, Theoretical Computer Science, Discrete Mathematics and Combinatorics, Physical, chemical, mathematical & earth Sciences, Mathematics, Physique, chimie, mathématiques & sciences de la terre, Mathématiques
الوصف: peer reviewed ; A coloring of a graph is an assignment of colors to its vertices such that adjacent vertices have different colors. Two colorings are equivalent if they induce the same partition of the vertex set into color classes. Let A(G) be the average number of colors in the non-equivalent colorings of a graph G. We give a general upper bound on A(G) that is valid for all graphs G and a more precise one for graphs G of order n and maximum degree Δ (G) ∈ { 1 , 2 , n- 2 }.
نوع الوثيقة: article in journal/newspaper
اللغة: English
تدمد: 0911-0119
Relation: https://link.springer.com/content/pdf/10.1007/s00373-023-02637-9.pdf; urn:issn:0911-0119; https://orbi.umons.ac.be/handle/20.500.12907/48153; info:hdl:20.500.12907/48153
DOI: 10.1007/s00373-023-02637-9
الاتاحة: https://orbi.umons.ac.be/handle/20.500.12907/48153
https://hdl.handle.net/20.500.12907/48153
https://orbi.umons.ac.be/bitstream/20.500.12907/48153/1/s00373-023-02637-9.pdf
https://doi.org/10.1007/s00373-023-02637-9
Rights: open access ; http://purl.org/coar/access_right/c_abf2 ; info:eu-repo/semantics/openAccess
رقم الانضمام: edsbas.C79FA546
قاعدة البيانات: BASE
الوصف
تدمد:09110119
DOI:10.1007/s00373-023-02637-9