Open Access
Issue |
RAIRO-Oper. Res.
Volume 56, Number 5, September-October 2022
|
|
---|---|---|
Page(s) | 3765 - 3776 | |
DOI | https://doi.org/10.1051/ro/2022171 | |
Published online | 01 November 2022 |
- S. Arumugam and J. Sithara, Fractional edge domination in graphs. Appl. Anal. Discrete Math. 3 (2009) 359–370. [CrossRef] [MathSciNet] [Google Scholar]
- A.S. Asration and C.J. Casselgren, On interval edge colorings of (α, β)-biregular bipartite graphs. Discrete Math. 307 (2007) 1951–1956. [CrossRef] [MathSciNet] [Google Scholar]
- L. Barenboim, R. Drucker, O. Zatulovsky and E. Levi, Memory allocation for neural networks using graph coloring, in 23rd International Conference on Distributed Computing and Networking (2022) 232–233. [Google Scholar]
- D.M. Cardoso, J.O. Cerdeira, J.P. Cruz and C. Dominic, Injective edge chromatic index of a graph. Preprint: arXiv:1510.02626 (2015). [Google Scholar]
- D.M. Cardoso, J.O. Cerdeira, J.P. Cruz and C. Dominic, Injective edge coloring of graphs. Filomat 33 (2019) 6411–6423. [CrossRef] [MathSciNet] [Google Scholar]
- G. Chartrand and L. Lesniak, Graphs and Digraphs, 4th edition. CRC Press, Boca Raton (2005). [Google Scholar]
- M. Chellali, T.W. Haynes and L. Volkmann, k-independence stable graphs upon edge removal. Discuss. Math. Graph Theory 30 (2010) 265–274. [CrossRef] [MathSciNet] [Google Scholar]
- P.J.P. Grobler and C.M. Mynhardt, Domination parameters and edge-removal-critical graphs. Discrete Math. 231 (2001) 221–239. [CrossRef] [MathSciNet] [Google Scholar]
- S. Khelifi and M. Chellali, Double domination critical and stable graphs upon vertex removal. Discuss. Math. Graph Theory 32 (2012) 643–657. [CrossRef] [MathSciNet] [Google Scholar]
- S. Khor, Application of graph colouring to biological networks. IET Syst. Biol. 4 (2010) 185–192. [CrossRef] [PubMed] [Google Scholar]
- A. Kostochka, A. Raspaud and J. Xu, Injective edge-coloring of graphs with given maximum degree. Eur. J. Comb. 96 (2021) 103335. [Google Scholar]
- Z. Miao, Y. Song and G. Yu, Note on injective edge-coloring of graphs. Discrete Appl. Math. 310 (2022) 65–74. [CrossRef] [MathSciNet] [Google Scholar]
- G. Raeisi and M. Gholami, Edge coloring of graphs with applications in coding theory. China Commun. 18 (2021) 181–195. [CrossRef] [Google Scholar]
- S.K. Vaidya and N.B. Vyas, Product cordial labeling for alternate snake graphs. Malaya J. Mat. 2 (2014) 188–196. [Google Scholar]
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.