Complexité de l'arboricité linéaire d'un graphe II

DOI10.1051/RO/1985190302931zbMATH Open0608.05029OpenAlexW4249569166MaRDI QIDQ3748293FDOQ3748293

Authors: B. Péroche 

Publication date: 1985

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/104885

Recommendations

• Linear arboricity of digraphs
• On linear k-arboricity
• Trees, paths, stars, caterpillars and spiders
• The linear 2-arboricity of some planar graphs.
• scientific article; zbMATH DE number 3957129

zbMATH Keywords

linear arboricityNP completeness

Mathematics Subject Classification ID

Trees (05C05) Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (4)

• Title not available (Why is that?)
• Towards the linear arboricity conjecture
• Graph factors and factorization: 1985--2003: a survey
• Linear arboricity of digraphs

This page was built for publication: Complexité de l'arboricité linéaire d'un graphe II

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3748293)