Bernard Ries

Article. Galby, E. and Lima, P.T. and Mann, F. and Ries, B., Using edge contractions to reduce the semitotal domination number, Theoretical Computer Science 939 (2023), p. 140-160
https://doi.org...

Autre. Lucke, F. and Paulusma, D. and Ries, B., Dichotomies for Maximum Matching Cut: H-Freeness, Bounded Diameter, Bounded Radius , 2023
https://doi.org...

Article. Bonomo-Braberman, F. and Mazzoleni, M.P. and Rean, M.L. and Ries, B., On some special classes of contact B0-VPG graphs, Discrete Applied Mathematics 308 (2022), p. 111-129
https://doi.org...

Autre. Lucke, F. and Paulusma, D. and Ries, B., On The Complexity of Matching Cut for Graphs of Bounded Radius and H-Free Graphs , 2022
http://www.scopus.com...

Autre. Baghirova, N. and Dallard, C. and Ries, B. and Schindl, D., FINDING K-COMMUNITY STRUCTURES IN SPECIAL GRAPH CLASSES , 2022
https://doi.org...

Autre. Baghirova, N. and Gonzalez, C.L. and Ries, B. and Schindl, D., LOCALLY CHECKABLE PROBLEMS PARAMETERIZED BY CLIQUE-WIDTH , 2022
https://doi.org...

Autre. Lucke, F. and Paulusma, D. and Ries, B., Finding Matching Cuts in H-Free Graphs , 2022
https://doi.org...

Autre. Feghali, C. and Lucke, F. and Paulusma, D. and Ries, B., Matching Cuts in Graphs of High Girth and H-Free Graphs , 2022
https://doi.org...

Conférence. Lucke, F. and Paulusma, D. and Ries, B., Finding Matching Cuts in H-Free Graphs, Leibniz International Proceedings in Informatics, LIPIcs: 2022
https://doi.org...

Autre. Lucke, F. and Paulusma, D. and Ries, B., On The Complexity of Matching Cut for Graphs of Bounded Radius and H-Free Graphs , 2022
https://doi.org...

Article. Lucke, F. and Paulusma, D. and Ries, B., On the complexity of matching cut for graphs of bounded radius and H-free graphs, Theoretical Computer Science 936 (2022), p. 33-42
https://doi.org...

Conférence. Baghirova, N. and Gonzalez, C.L. and Ries, B. and Schindl, D., Locally Checkable Problems Parameterized by Clique-Width, Leibniz International Proceedings in Informatics, LIPIcs: 2022
https://doi.org...

Article. Nicolas Champseix and Esther Galby and Andrea Munaro and Bernard Ries, CPG graphs: Some structural and hardness results, Discrete Applied Mathematics 290 (2.2021), p. 17–35
https://doi.org...

Autre. Galby, E. and Lima, P.T. and Mann, F. and Ries, B., Using edge contractions to reduce the semitotal domination number , 2021
http://www.scopus.com...

Article. Galby, E. and Mann, F. and Ries, B., Reducing the domination number of (P3+kP2)-free graphs via one edge contraction, Discrete Applied Mathematics 305 (2021), p. 205-210
https://doi.org...

Article. Galby, E. and Lima, P.T. and Ries, B., Reducing the domination number of graphs via edge contractions and vertex deletions, Discrete Mathematics 344.1 (2021)
https://doi.org...

Article. Galby, E. and Mann, F. and Ries, B., Blocking total dominating sets via edge contractions, Theoretical Computer Science 877 (2021), p. 18-35
https://doi.org...

Article. Chen, B. and Martello, S. and Ries, B., New progress in combinatorial optimization, Discrete Applied Mathematics 290 (2021), p. 68-70
https://doi.org...

Article. Galby, E. and Munaro, A. and Ries, B., Semitotal Domination: New hardness results and a polynomial-time algorithm for graphs of bounded mim-width, Theoretical Computer Science 814 (2020), p. 28-48
https://doi.org...

Autre. Galby, E. and Mann, F. and Ries, B., Blocking total dominating sets via edge contractions , 2020
http://www.scopus.com...

Livre. Deniz, Z. and Nivelle, S. and Ries, B. and Schindl, D., On Some Subclasses of Split B1 -EPG Graphs (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2020) 625-636
https://doi.org...

Article. Paulusma, D. and Picouleau, C. and Ries, B., Critical vertices and edges in H-free graphs, Discrete Applied Mathematics 257 (2019), p. 361-367
https://doi.org...

Article. Hujdurovi?, A. and Milani?, M. and Ries, B., Detecting strong cliques, Discrete Mathematics 342.9 (2019), p. 2738-2750
https://doi.org...

Article. Galby, E. and Lima, P.T. and Paulusma, D. and Ries, B., Classifying k-edge colouring for H-free graphs, Information Processing Letters 146 (2019), p. 39-43
https://doi.org...

Article. Crama, Y. and Gendron, B. and Ries, B., Preface: Tenth International Colloquium on Graphs and Optimization (GO X), 2016, Discrete Applied Mathematics 261 (2019), p. 1
https://doi.org...

Article. Galby, E. and Mazzoleni, M.P. and Ries, B., Proper circular arc graphs as intersection graphs of pathson a grid, Discrete Applied Mathematics 262 (2019), p. 195-202
https://doi.org...

Conférence. Galby, E. and Lima, P.T. and Ries, B., Blocking dominating sets for H-free graphs via edge contractions, Leibniz International Proceedings in Informatics, LIPIcs: 2019
https://doi.org...

Conférence. Galby, E. and Lima, P.T. and Ries, B., Reducing the domination number of graphs via edge contractions, Leibniz International Proceedings in Informatics, LIPIcs: 2019
https://doi.org...

Article. Hauweele, P. and Hertz, A. and Mélot, H. and Ries, B. and Devillez, G., Maximum eccentric connectivity index for graphs with given diameter, Discrete Applied Mathematics 268 (2019), p. 102-111
https://doi.org...

Autre. Galby, E. and Lima, P.T. and Ries, B., Blocking dominating sets for H-free graphs via edge contractions , 2019
http://www.scopus.com...

Autre. Galby, E. and Paloma, T.L. and Ries, B., Reducing the domination number of graphs via edge contractions , 2019
http://www.scopus.com...

Autre. Champseix, N. and Galby, E. and Munaro, A. and Ries, B., CPG graphs: Some structural and hardness results , 2019
http://www.scopus.com...

Autre. Galby, E. and Lima, P.T. and Paulusma, D. and Ries, B., On the parameterized complexity of k-edge colouring , 2019
http://www.scopus.com...

Article. Alcón, L. and Bonomo, F. and Durán, G. and Gutierrez, M. and Mazzoleni, M.P. and Ries, B. and Valencia-Pabon, M., On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid, Discrete Applied Mathematics 234 (2018), p. 12-21
https://doi.org...

Article. AbouEisha, H. and Hussain, S. and Lozin, V. and Monnot, J. and Ries, B. and Zamaraev, V., Upper Domination: Towards a Dichotomy Through Boundary Properties, Algorithmica 80.10 (2018), p. 2799-2817
https://doi.org...

Livre. Deniz, Z. and Galby, E. and Munaro, A. and Ries, B., On contact graphs of paths on a grid (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2018) 317-330
https://doi.org...

Livre. Deniz, Z. and Nivelle, S. and Ries, B. and Schindl, D., On split B<inf>1</inf> -EPG graphs (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2018) 361-375
https://doi.org...

Article. Hertz, A. and Lozin, V. and Ries, B. and Zamaraev, V. and de Werra, D., Dominating induced matchings in graphs containing no long claw, Journal of Graph Theory 88.1 (2018), p. 18-39
https://doi.org...

Article. Diner, Ö.Y. and Paulusma, D. and Picouleau, C. and Ries, B., Contraction and deletion blockers for perfect graphs and H-free graphs, Theoretical Computer Science 746 (2018), p. 49-72
https://doi.org...

Livre. Bonomo, F. and Mazzoleni, M.P. and Rean, M.L. and Ries, B., Characterising Chordal ContactB<inf>0</inf>-VPG Graphs (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2018) 89-100
https://doi.org...

Article. Hujdurovi?, A. and Milani?, M. and Ries, B., Graphs vertex-partitionable into strong cliques, Discrete Mathematics 341.5 (2018), p. 1392-1405
https://doi.org...

Article. Hujdurovic, A. and Kacar, U. and Milanic, M. and Ries, B. and Tomescu, A.I., Complexity and Algorithms for Finding a Perfect Phylogeny from Mixed Tumor Samples, IEEE/ACM Transactions on Computational Biology and Bioinformatics 15.1 (2018), p. 96-108
https://doi.org...

Autre. Champseix, N. and Galby, E. and Ries, B., Planar CPG graphs , 2018
http://www.scopus.com...

Autre. Galby, E. and Munaro, A. and Ries, B., Semitotal Domination: New hardness results and a polynomial-Time algorithm for graphs of bounded mim-width , 2018
http://www.scopus.com...

Autre. Galby, E. and Lima, P.T. and Paulusma, D. and Ries, B., Classifying k-edge colouring for H-free graphs , 2018
http://www.scopus.com...

Autre. Galby, E. and Mazzoleni, M.P. and Ries, B., Proper circular arc graphs as intersection graphs of paths on a grid , 2018
http://www.scopus.com...

Autre. Hujdurovi?, A. and Milani?, M. and Ries, B., Detecting strong cliques , 2018
http://www.scopus.com...

Autre. Bonomo, F. and Mazzoleni, M.P. and Rean, M.L. and Ries, B., On some special classes of contact B0-VPG graphs , 2018
http://www.scopus.com...

Autre. Deniz, Z. and Galby, E. and Munaro, A. and Ries, B., On contact graphs of paths on a Grid , 2018
http://www.scopus.com...

Article. Dantas, S. and Groshaus, M. and Guedes, A. and Machado, R.C.S. and Ries, B. and Sasaki, D., On star and biclique edge-colorings, International Transactions in Operational Research 24.1-2 (2017), p. 339-346
https://doi.org...

Livre. Paulusma, D. and Picouleau, C. and Ries, B., Blocking independent sets for h -free graphs via edge contractions and vertex deletions (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2017) 470-483
https://doi.org...

Article. Picouleau, C. and Paulusma, D. and Ries, B., Reducing the Chromatic Number by Vertex or Edge Deletions, Electronic Notes in Discrete Mathematics 62 (2017), p. 243-248
https://doi.org...

Autre. Diner, O.Y. and Paulusma, D. and Picouleau, C. and Ries, B., Contraction and deletion blockers for perfect graphs and h-free graphs? , 2017
http://www.scopus.com...

Autre. Paulusma, D. and Picouleau, C. and Ries, B., Critical Vertices and Edges in H-free Graphs? , 2017
http://www.scopus.com...

Article. Demange, M. and Ekim, T. and Ries, B., On the minimum and maximum selective graph coloring problems in some graph classes, Discrete Applied Mathematics 204 (2016), p. 77-89
https://doi.org...

Article. Da Fonseca, G.D. and Ries, B. and Sasaki, D., On the ratio between maximum weight perfect matchings and maximum weight matchings in grids, Discrete Applied Mathematics 207 (2016), p. 45-55
https://doi.org...

Livre. Aboueisha, H. and Hussain, S. and Lozin, V. and Monnot, J. and Ries, B. and Zamaraev, V., A boundary property for upper domination (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2016) 229-240
https://doi.org...

Livre. Paulusma, D. and Picouleau, C. and Ries, B., Reducing the clique and chromatic number via edge contractions and vertex deletions (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2016) 38-49
https://doi.org...

Conférence. Amanatidis, G. and Barrot, N. and Lang, J. and Markakis, E. and Ries, B., Multiple referenda and multiwinner elections using Hamming distances: Complexity and manipulability, Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS: 2015, p. 715-723
http://www.scopus.com...

Article. Demange, M. and Ekim, T. and Ries, B. and Tanasescu, C., On some applications of the selective graph coloring problem, European Journal of Operational Research 240.2 (2015), p. 307-314
https://doi.org...

Livre. Diner, Ö.Y. and Paulusma, D. and Picouleau, C. and Ries, B., Contraction blockers for graphs with forbidden induced paths (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2015) 194-207
https://doi.org...

Article. Golovach, P.A. and Paulusma, D. and Ries, B., Coloring graphs characterized by a forbidden subgraph, Discrete Applied Mathematics 180 (2015), p. 101-110
https://doi.org...

Article. Alcón, L. and Bonomo, F. and Durán, G. and Gutierrez, M. and Pía Mazzoleni, M. and Ries, B. and Valencia-Pabon, M., On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid, Electronic Notes in Discrete Mathematics 50 (2015), p. 249-254
https://doi.org...

Livre. Hujdurovié, A. and Kacar, U. and Milani?, M. and Ries, B. and Tomescu, A.I., Finding a perfect phylogeny from mixed tumor samples (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2015) 80-92
https://doi.org...

Article. Barrot, N. and Lang, J. and Ries, B., Approval voting for committee election: A general family of rules, their complexity and their manipulability,Vote par approbation pour les élections à vainqueurs multiples: Une famille générale de règles, leur complexité algorithmique et leur manipulabilité, Revue d’Intelligence Artificielle 29.3-4 (2015), p. 265-291
https://doi.org...

Article. Lozin, V. and Monnot, J. and Ries, B., On the maximum independent set problem in subclasses of subcubic graphs, Journal of Discrete Algorithms 31 (2015), p. 104-112
https://doi.org...

Article. Bazgan, C. and Bentz, C. and Picouleau, C. and Ries, B., Blockers for the Stability Number and the Chromatic Number, Graphs and Combinatorics 31.1 (2015), p. 73-90
https://doi.org...

Article. Martello, S. and Ries, B., Advances in combinatorial optimization, Discrete Applied Mathematics 196 (2015), p. 1-3
https://doi.org...

Article. Demange, M. and Monnot, J. and Pop, P. and Ries, B., On the complexity of the selective graph coloring problem in some special classes of graphs?, Theoretical Computer Science 540-541.1 (2014), p. 89-102
https://doi.org...

Article. Hertz, A. and Ries, B., A note on r-equitable k-colorings of trees, Yugoslav Journal of Operations Research 24.2 (2014), p. 293-298
https://doi.org...

Livre. Aboueisha, H. and Hussain, S. and Lozin, V. and Monnot, J. and Ries, B., A dichotomy for upper domination in monogenic classes (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2014) 258-267
https://doi.org...

Article. Cohen, E. and Golumbic, M.C. and Ries, B., Characterizations of cographs as intersection graphs of paths on a grid, Discrete Applied Mathematics 178 (2014), p. 46-57
https://doi.org...

Article. Bonomo, F. and Cornaz, D. and Ekim, T. and Ries, B., Perfectness of clustered graphs, Discrete Optimization (2013)
https://doi.org...

Article. Demange, M. and Lozin, V. and Picouleau, C. and Ries, B., GO VII Meeting, Ovronnaz (CH), June 13-17, 2010, Discrete Applied Mathematics 161.4-5 (2013)
https://doi.org...

Livre. Barrot, N. and Gourvès, L. and Lang, J. and Monnot, J. and Ries, B., Possible winners in approval voting (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2013) 57-70
https://doi.org...

Article. Bazgan, C. and Chopin, M. and Ries, B., The firefighter problem with more than one firefighter on trees, Discrete Applied Mathematics 161.7-8 (2013), p. 899-908
https://doi.org...

Livre. Lozin, V. and Monnot, J. and Ries, B., On the maximum independent set problem in subclasses of subcubic graphs (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2013) 314-326
https://doi.org...

Article. Dereniowski, D. and Kubiak, W. and Ries, B. and Zwols, Y., Optimal edge-coloring with edge rate constraints, Networks 62.3 (2013), p. 165-182
https://doi.org...

Article. Bentz, C. and Cornaz, D. and Ries, B., Packing and covering with linear programming: A survey, European Journal of Operational Research 227.3 (2013), p. 409-422
https://doi.org...

Article. Golumbic, M.C. and Ries, B., On the Intersection Graphs of Orthogonal Line Segments in the Plane: Characterizations of Some Subclasses of Chordal Graphs, Graphs and Combinatorics 29.3 (2013), p. 499-517
https://doi.org...

Livre. Golovach, P.A. and Paulusma, D. and Ries, B., Coloring graphs characterized by a forbidden subgraph (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2012) 443-454
https://doi.org...

Article. Asinowski, A. and Ries, B., Some properties of edge intersection graphs of single-bend paths on a grid, Discrete Mathematics 312.2 (2012), p. 427-440
https://doi.org...

Article. Dabrowski, K.K. and Lozin, V. and Raman, R. and Ries, B., Colouring vertices of triangle-free graphs without forests, Discrete Mathematics 312.7 (2012), p. 1372-1385
https://doi.org...

Article. Ries, B. and De Werra, D. and Zenklusen, R., A note on chromatic properties of threshold graphs, Discrete Mathematics 312.10 (2012), p. 1838-1843
https://doi.org...

Article. Birand, B. and Chudnovsky, M. and Ries, B. and Seymour, P. and Zussman, G. and Zwols, Y., Analyzing the performance of greedy maximal scheduling via local pooling and graph theory, IEEE/ACM Transactions on Networking 20.1 (2012), p. 163-176
https://doi.org...

Livre. Demange, M. and Monnot, J. and Pop, P. and Ries, B., Selective graph coloring in some special classes of graphs (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2012) 320-331
https://doi.org...

Article. Bentz, C. and Costa, M.-C. and Picouleau, C. and Ries, B. and De Werra, D., D-Transversals of stable sets and vertex covers in weighted bipartite graphs, Journal of Discrete Algorithms 17 (2012), p. 95-102
https://doi.org...

Article. Bentz, C. and Costa, M.-C. and de Werra, D. and Picouleau, C. and Ries, B., Minimum d-Transversals of Maximum-Weight Stable Sets in Trees, Electronic Notes in Discrete Mathematics 38 (2011), p. 129-134
https://doi.org...

Article. Ries, B. and Zenklusen, R., A 2-approximation for the maximum satisfying bisection problem, European Journal of Operational Research 210.2 (2011), p. 169-175
https://doi.org...

Article. Chudnovsky, M. and Ries, B. and Zwols, Y., Claw-free graphs with strongly perfect complements. Fractional and integral version, Part II: Nontrivial strip-structures, Discrete Applied Mathematics 159.17 (2011), p. 1996-2029
https://doi.org...

Article. Chudnovsky, M. and Ries, B. and Zwols, Y., Claw-free graphs with strongly perfect complements. Fractional and integral version. Part I. Basic graphs, Discrete Applied Mathematics 159.17 (2011), p. 1971-1995
https://doi.org...

Article. Ekim, T. and Ries, B. and De Werra, D., Split-critical and uniquely split-colorable graphs, Discrete Mathematics and Theoretical Computer Science 12.5 (2010), p. 1-24
http://www.scopus.com...

Article. Ries, B., Complexity of two coloring problems in cubic planar bipartite mixed graphs, Discrete Applied Mathematics 158.5 (2010), p. 592-596
https://doi.org...

Article. Ries, B. and Bentz, C. and Picouleau, C. and de Werra, D. and Costa, M.-C. and Zenklusen, R., Blockers and transversals in some subclasses of bipartite graphs: When caterpillars are dancing on a grid, Discrete Mathematics 310.1 (2010), p. 132-146
https://doi.org...

Livre. Dabrowski, K. and Lozin, V. and Raman, R. and Ries, B., Colouring vertices of triangle-free graphs (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2010) 184-195
https://doi.org...

Article. de Werra, D. and Costa, M.-C. and Picouleau, C. and Ries, B., On the use of graphs in discrete tomography, Annals of Operations Research 175.1 (2010), p. 287-307
https://doi.org...

Conférence. Birand, B. and Chudnovsky, M. and Ries, B. and Seymour, P. and Zussman, G. and Zwols, Y., Analyzing the performance of greedy maximal scheduling via local pooling and graph theory, Proceedings - IEEE INFOCOM: 2010
https://doi.org...

Conférence. Birand, B. and Chudnovsky, M. and Ries, B. and Seymour, P. and Zussman, G. and Zwols, Y., Analyzing the performance of greedy maximal scheduling via local pooling and graph theory, Proceedings of the Annual International Conference on Mobile Computing and Networking, MOBICOM: 2010, p. 17-19
https://doi.org...

Article. Tınaz Ekim, Bernard Ries, Dominique De Werra, Split-critical and uniquely split-colorable graphs, Discrete Mathematics & Theoretical Computer Science (1.1.2010)
https://doi.org...

Article. Bentz, C. and Costa, M.-C. and Picouleau, C. and Ries, B. and de Werra, D., Degree-constrained edge partitioning in graphs arising from discrete tomography, Journal of Graph Algorithms and Applications 13.2 (2009), p. 99-118
http://www.scopus.com...

Article. Costa, M.-C. and de Werra, D. and Picouleau, C. and Ries, B., Graph coloring with cardinality constraints on the neighborhoods, Discrete Optimization 6.4 (2009), p. 362-369
https://doi.org...

Article. Furma?czyk, H. and Kosowski, A. and Ries, B. and Zyli?ski, P., Mixed graph edge coloring, Discrete Mathematics 309.12 (2009), p. 4027-4036
https://doi.org...

Article. Zenklusen, R. and Ries, B. and Picouleau, C. and de Werra, D. and Costa, M.-C. and Bentz, C., Blockers and transversals, Discrete Mathematics 309.13 (2009), p. 4306-4314
https://doi.org...

Article. Ries, B., Some properties of edge intersection graphs of single bend paths on a grid, Electronic Notes in Discrete Mathematics 34 (2009), p. 29-33
https://doi.org...

Article. De Werra, D. and Costa, M.-C. and Picouleau, C. and Ries, B., On the use of graphs in discrete tomography, 4OR 6.2 (2008), p. 101-123
https://doi.org...

Article. Ries, B. and de Werra, D., On two coloring problems in mixed graphs, European Journal of Combinatorics 29.3 (2008), p. 712-725
https://doi.org...

Article. Costa, M.C. and De Werra, D. and Picouleau, C. and Ries, B., Bicolored matchings in some classes of graphs (Graphs and Combinatorics (2007) 23, (47-60)), Graphs and Combinatorics 24.2 (2008), p. 127-128
https://doi.org...

Article. Bentz, C. and Costa, M.C. and De Werra, D. and Picouleau, C. and Ries, B., On a graph coloring problem arising from discrete tomography, Networks 51.4 (2008), p. 256-267
https://doi.org...

Article. Costa, M.C. and Werra, D.D. and Picouleau, C. and Ries, B., Bicolored matchings in some classes of graphs, Graphs and Combinatorics 23.1 (2007), p. 47-60
https://doi.org...

Article. Ries, B., Coloring some classes of mixed graphs, Discrete Applied Mathematics 155.1 (2007), p. 1-6
https://doi.org...

Article. Costa, M.-C. and de Werra, D. and Picouleau, C. and Ries, B., Bicolored matchings in some classes of graphs, Electronic Notes in Discrete Mathematics 22 (2005), p. 207-211
https://doi.org...

Recherche et publications

Enseignement et cours