Skip to main content
SpringerLink
Log in

Algorithmic Aspects of the Maximum 2-edge-colorable Subgraph Problem

  • Conference paper
  • First Online:
Advanced Information Networking and Applications (AINA 2021)

Part of the book series: Lecture Notes in Networks and Systems ((LNNS,volume 227))

Abstract

A k-edge-coloring of a graph is an assignment of colors from a set of k colors to edges of the graph such that adjacent edges receive different colors. A maximum k-edge-colorable subgraph in a graph is a k-edge-colorable subgraph containing a maximum possible number of edges. In the maximum k-edge-colorable subgraph problem we are given a graph and an integer k, the goal is to find a maximum k-edge-colorable subgraph together with its k-edge-coloring. In this paper, we consider the maximum 2-edge-colorable subgraph problem and present some results that deal with the fixed-parameter tractability of this problem. Our main results state that the problem is fixed-parameter tractable with respect to carvingwidth and pathwidth.

This work has been partially supported by the Italian MIUR PRIN 2017 Project ALGADIMAR “Algorithms, Games, and Digital Markets”.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Albertson, M., Haas, R.: Parsimonious edge colouring. Discrete Math. 148, 1–7 (1996)

    Article  MathSciNet  Google Scholar 

  2. Albertson, M., Haas, R.: The edge chromatic difference sequence of a cubic graph. Discrete Math. 177, 1–8 (1997)

    Article  MathSciNet  Google Scholar 

  3. Aloisio, A., Navarra, A.: Constrained connectivity in bounded X-width multi-interface networks. Algorithms 13(2), 31 (2020)

    Article  MathSciNet  Google Scholar 

  4. Aloisio, A., Navarra, A., Mostarda, L.: Energy consumption balancing in multi-interface networks. J. Ambient. Intell. Humaniz. Comput. 11(8), 3209–3219 (2019). ISSN 1868-5145

    Article  Google Scholar 

  5. Aloisio, A., Arbib, C., Marinelli, F.: Cutting stock with no three parts per pattern: work-in-process and pattern minimization. Discrete Optim. 8(2), 315–332 (2011)

    Article  MathSciNet  Google Scholar 

  6. Aloisio, A., Arbib, C., Marinelli, F.: On LP relaxations for the pattern minimization problem. Networks 57(3), 247–253 (2011)

    Article  MathSciNet  Google Scholar 

  7. Aloisio, A., Navarra, A.: Balancing energy consumption for the establishment of multi-interface networks. In: SOFSEM 2015: Theory and Practice of Computer Science, vol. 8939, pp. 102–114. Springer, Heidelberg (2015)

    Google Scholar 

  8. Aloisio, A.: Coverage, subject to a budget on multi-interface networks with bounded carving-width. In: WAINA, Advances in Intelligent Systems and Computing, vol. 1150, pp. 937–946. Springer, Cham (2020)

    Google Scholar 

  9. Aloisio, A., Navarra, A.: Budgeted constrained coverage on bounded carving-width and series-parallel multi-interface networks. Internet Things 11, 100259 (2020)

    Article  Google Scholar 

  10. Aloisio, A., Budgeted constrained coverage on series-parallel multi-interface networks. In: AINA, Advances in Intelligent Systems and Computing, vol. 1151. Springer, Cham (2020)

    Google Scholar 

  11. Aloisio, A., Navarra, A., Mostarda, L.: Distributing energy consumption in multi-interface series-parallel networks. In: WAINA 2019, Advances in Intelligent Systems and Computing, vol. 927, pp. 734–744. Springer, Cham (2019)

    Google Scholar 

  12. Aslanyan, D., Mkrtchyan, V., Petrosyan, S., Vardanyan, G.: On disjoint matchings in cubic graphs: maximum 2-edge-colourable and maximum 3-edge-colourable subgraphs. Discrete Appl. Math. 172, 12–27 (2014)

    Article  MathSciNet  Google Scholar 

  13. Belmonte, R., Hof, P., Kamiński, M., Paulusma, D., Thilikos, D.M.: Characterizing graphs of small carving-width. Discrete Appl. Math. 161, 1888–1893 (2013)

    Article  MathSciNet  Google Scholar 

  14. Bodlaender, H.L.: A linear time algorithm for finding tree-decompositions of small treewidth. IAM J. Comput. 25, 1305–1317 (1996)

    MathSciNet  MATH  Google Scholar 

  15. Cattell, K., Dinneen, M.J., Fellows, M.R.: A simple linear-time algorithm for finding path-decompositions of small width. Inf. Process. Lett. 57(4), 197–203 (1996)

    Article  MathSciNet  Google Scholar 

  16. Cavicchioli, A., Meschiari, M., Ruini, B., Spaggiari, F.: A survey on snarks and new results: products, reducibility and a computer search. Discrete Math. 28(2), 57–86 (1998)

    MathSciNet  MATH  Google Scholar 

  17. Cygan, M., Fomin, F.V., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms, pp. 3–555. Springer, Cham (2015). ISBN 978-3-319-21274-6

    Google Scholar 

  18. Feige, U., Ofek, E., Wieder, U.: Approximating maximum edge colouring in multigraphs. Lecture Notes in Computer Science, vol. 2462, pp. 108–121 (2002)

    Google Scholar 

  19. Flaxman, A.D., Hoory, S.: Maximum matchings in regular graphs of high girth. Electron. J. Comb. 14(1), 1–4 (2007)

    Article  MathSciNet  Google Scholar 

  20. Fomin, F.V., Kratsch, D.: Exact Exponential Algorithms. Springer, Heidelberg (2010)

    Book  Google Scholar 

  21. Fouquet, J.L., Vanherpe, J.M.: On parsimonious edge-colouring of graphs with maximum degree three. Graphs Comb. 29(3), 475–487 (2013)

    Article  MathSciNet  Google Scholar 

  22. Henning, M.A., Yeo, A.: Tight lower bounds on the size of a maximum matching in a regular graph. Graphs Comb. 23(6), 647–657 (2007)

    Article  MathSciNet  Google Scholar 

  23. Holyer, I.: The NP-completeness of edge-colouring. SIAM J. Comput. 10(4), 718–720 (1981)

    Article  MathSciNet  Google Scholar 

  24. Karapetyan, L., Mkrtchyan, V.: On maximum \(k\)-edge-colourable subgraphs of bipartite graphs. Disc. Appl. Math. 257, 226–232 (2019)

    Article  Google Scholar 

  25. Kamiński, M.J., Kowalik, Ł.: Beyond the Vizing’s bound for at most seven colours. SIAM J. Discrete Math. 28(3), 1334–1362 (2014)

    Article  MathSciNet  Google Scholar 

  26. Kosowski, A.: Approximating the maximum 2- and 3-edge-colourable problems. Discrete Appl. Math. 157, 3593–3600 (2009)

    Article  MathSciNet  Google Scholar 

  27. Mkrtchyan, V., Petrosyan, S., Vardanyan, G.: On disjoint matchings in cubic graphs. Discrete Math. 310, 1588–1613 (2010)

    Article  MathSciNet  Google Scholar 

  28. Mkrtchyan, V., Petrosyan, S., Vardanyan, G.: Corrigendum to “On disjoint matchings in cubic graphs”. Discrete Math. 313(21), 2381 (2013)

    Article  MathSciNet  Google Scholar 

  29. Mkrtchyan, V., Steffen, E.: Maximum \(\Delta \)-edge-colourable subgraphs of class II graphs. J. Graph Theory 70(4), 473–482 (2012)

    Article  MathSciNet  Google Scholar 

  30. Nishizeki, T.: On the maximum matchings of regular multigraphs. Discrete Math. 37, 105–114 (1981)

    Article  MathSciNet  Google Scholar 

  31. Shannon, C.E.: A theorem on colouring the lines of a network. J. Math. Phys. 28, 148–151 (1949)

    Article  Google Scholar 

  32. Steffen, E.: Classifications and characterizations of snarks. Discrete Math. 188, 183–203 (1998)

    Article  MathSciNet  Google Scholar 

  33. Steffen, E.: Measurements of edge-uncolourability. Discrete Math. 280, 191–214 (2004)

    Article  MathSciNet  Google Scholar 

  34. Stiebitz, M., Scheide, D., Toft, B., Favrholdt, L.M.: Graph Edge Colouring. Wiley, Hoboken (2012)

    MATH  Google Scholar 

  35. Thilikos, D., Serna, M., Bodlaender, H.: Constructive linear time algorithms for small cutwidth and carving-width. In: Proceedings of the 11th International Conference on Algorithms and Computation (ISAAC), Taipei, Taiwan, 18–20 December 2000, pp. 192–203 (2000)

    Google Scholar 

  36. Vizing, V.: On an estimate of the chromatic class of a \(p\)-graph. Diskret Analiz 3, 25–30 (1964)

    MathSciNet  Google Scholar 

  37. West, D.: Introduction to Graph Theory. Prentice-Hall, Englewood Cliffs (1996)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Gran Sasso Science Institute, School of Advanced Studies, L’Aquila, Italy

    Alessandro Aloisio & Vahan Mkrtchyan

  2. Department of Information Engineering, Computer Science and Maths, University of L’Aquila, L’Aquila, Italy

    Alessandro Aloisio

Authors
  1. Alessandro Aloisio
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vahan Mkrtchyan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Alessandro Aloisio .

Editor information

Editors and Affiliations

  1. Department of Information and Communication Engineering, Fukuoka Institute of Technology, Fukuoka, Japan

    Leonard Barolli

  2. Department of Computer Science, Ryerson University, Toronto, ON, Canada

    Isaac Woungang

  3. Faculty of Business Administration, Rissho University, Tokyo, Japan

    Tomoya Enokido

Rights and permissions

Reprints and permissions

Copyright information

© 2021 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Aloisio, A., Mkrtchyan, V. (2021). Algorithmic Aspects of the Maximum 2-edge-colorable Subgraph Problem. In: Barolli, L., Woungang, I., Enokido, T. (eds) Advanced Information Networking and Applications. AINA 2021. Lecture Notes in Networks and Systems, vol 227. Springer, Cham. https://doi.org/10.1007/978-3-030-75078-7_24

Download citation

Publish with us

Policies and ethics

Search

Navigation