Abstract
An undirected graph G is locally irregular if every two of its adjacent vertices have distinct degrees. We say that G is decomposable into k locally irregular graphs if there exists a partition \(E_1 \cup E_2 \cup \cdots \cup E_k\) of the edge set E(G) such that each \(E_i\) induces a locally irregular graph. It was recently conjectured by Baudon et al. that every undirected graph admits a decomposition into at most three locally irregular graphs, except for a well-characterized set of indecomposable graphs. We herein consider an oriented version of this conjecture. Namely, can every oriented graph be decomposed into at most three locally irregular oriented graphs, i.e. whose adjacent vertices have distinct outdegrees? We start by supporting this conjecture by verifying it for several classes of oriented graphs. We then prove a weaker version of this conjecture. Namely, we prove that every oriented graph can be decomposed into at most six locally irregular oriented graphs. We finally prove that even if our conjecture were true, it would remain NP-complete to decide whether an oriented graph is decomposable into at most two locally irregular oriented graphs.
Similar content being viewed by others
Notes
Note that our investigations could have be done with respect to the indegrees instead.
References
Baudon, O., Bensmail, J., Przybyło, J., Woźniak, M.: On decomposing regular graphs into locally irregular subgraphs. Eur. J. Comb. 49, 90–104 (2015)
Chartrand, G., Jacobson, M.S., Lehel, J., Oellermann, O.R., Ruiz, S., Saba, F.: Irregular networks. Congr. Numerantium 64, 197–210 (1988)
Diestel, R.: Graph Theory. Graduate Texts in Mathematics, vol. 173, 3rd edn. Springer, Heidelberg (2005)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)
Imrich, W., Klavžar, S.: Product Graphs: Structure and Recognition. Wiley-Interscience, New York (2000)
Karoński, M., Łuczak, T., Thomason, A.: Edge weights and vertex colours. J. Comb. Theory Ser. B 91(1), 151–157 (2004)
Acknowledgments
The authors thank the anonymous referees for their careful reading of a previous version of the current paper. J. Bensmail was supported by ERC Advanced Grant GRACOL, Project No. 320812.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Bensmail, J., Renault, G. Decomposing Oriented Graphs into Six Locally Irregular Oriented Graphs. Graphs and Combinatorics 32, 1707–1721 (2016). https://doi.org/10.1007/s00373-016-1705-z
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-016-1705-z