A P₃-decomposition of tournaments and bipartite digraphs
From MaRDI portal
Publication:2357785
Abstract: A -decomposition of a directed graph is a partition of the arcs of into directed paths of length . In this paper, we give a characterization for a tournament and a bipartite digraph admitting a -decomposition. This solves a problem posed by Diwan (-decomposition of directed graphs, Discrete Appl. Math., http:// dx.doi.org/10.1016/j.dam.2016.01.039.).
Recommendations
Cites work
- Characterizations of derived graphs
- Decomposing graphs into paths of fixed length
- Decompositions of highly connected graphs into paths of length 3
- Edge-decompositions of highly connected graphs into paths
- From the theory of regular graphs of third and fourth degree
- Hamiltonian results inK1,3-free graphs
- scientific article; zbMATH DE number 3150485 (Why is no real title available?)
- scientific article; zbMATH DE number 47528 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3013308 (Why is no real title available?)
- On a closure concept in claw-free graphs
- On Representatives of Subsets
- Reflections on graph theory
- The Factorization of Linear Graphs
- The Factors of Graphs
Cited in
(4)
This page was built for publication: A \(\vec{P_3}\)-decomposition of tournaments and bipartite digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2357785)