Edge‐decomposing graphs into coprime forests
Work
Year: 2020
Type: article
Abstract: The Barát‐Thomassen conjecture, recently proved in Bensmail et al. (2017), asserts that for every tree , there is a constant such that every ‐edge‐connected graph with number of edges (size) divisibl... more
Source: Journal of Graph Theory
Authors Tereza Klimošová, Stéphan Thomassé
Institutions Charles University, Université Claude Bernard Lyon 1, École Normale Supérieure de Lyon, Centre National de la Recherche Scientifique, Institut Universitaire de France
Cites: 15
Cited by: 1
Related to: 10
FWCI: 0.114
Citation percentile (by year/subfield): 34.97
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Sustainable Development Goal Life on land
Open Access status: green
Funders Univerzita Karlova v Praze, Agence Nationale de la Recherche, Agence Nationale de la Recherche, Agence Nationale de la Recherche, Grantová Agentura České Republiky
Grant IDS C. for Foundations of Modern C. S./UNCE/SCI/004, Stint/ANR‐13‐BS02‐0007, LABEX MILYON/ANR‐10‐LABX‐0070, Investissements d'Avenir/ANR‐11‐IDEX‐0007, Center of Excellence – ITI/P202/12/G061