On distance edge-colourings and matchings |
| |
| Institution: | 1. School of Mathematics, Georgia Institute of Technology, Atlanta, GA 30332, United States of America;2. Institut für Mathematik, Technische Universität Berlin, Strasse des 17. Juni 136, D-10623 Berlin, Germany;3. Fachbereich Mathematik und Informatik, Kombinatorik und Graphentheorie, Freie Universität Berlin, Arnimallee 3, 14195 Berlin, Germany;4. Theoretical Computer Science Department, Faculty of Mathematics and Computer Science, Jagiellonian University, Kraków, Poland;5. Department of Mathematics and Computer Science Davidson College, Davidson, NC 28035, United States of America;1. Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, Wilberforce Road, CB3 0WB Cambridge, UK;2. Department of Mathematical Sciences, University of Memphis, Memphis TN 38152, USA;3. London Institute for Mathematical Sciences, 35a South St., Mayfair, London W1K 2XF, UK;1. Institute of Mathematics, P.J. Šafárik University in Košice, 04001 Košice, Slovakia;2. Institut für Diskrete Mathematik und Algebra, Technische Universität Bergakademie Freiberg, 09596 Freiberg, Germany;3. School of Science, Beijing University of Chemical Technology, Beijing 100029, China |
| |
| Abstract: | We consider a distance generalisation of the strong chromatic index and the maximum induced matching number, for graphs of bounded maximum degree and Erdős-Rényi random graphs. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
