Decomposing oriented graphs into six locally irregular oriented graphs

DOI10.1007/s00373-016-1705-zzbMath1351.05178OpenAlexW2340379504MaRDI QIDQ343709

Julien Bensmail, Gabriel Renault

Publication date: 29 November 2016

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://orbit.dtu.dk/en/publications/97206677-a3bd-407f-8460-02d498660133

zbMATH Keywords

complexityoriented graphdecomposition into locally irregular graphslocally irregular oriented graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

On a directed variation of the 1-2-3 and 1-2 conjectures ⋮ Graph classes with locally irregular chromatic index at most 4

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Edge weights and vertex colours
• On decomposing regular graphs into locally irregular subgraphs

This page was built for publication: Decomposing oriented graphs into six locally irregular oriented graphs