1996
DOI: 10.1007/3-540-61576-8_74
|View full text |Cite
|
Sign up to set email alerts
|

Complete bipartite decompositions of crowns, with applications to complete directed graphs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 9 publications
0
1
0
Order By: Relevance
“…We will use the following theorem on the least common multiple of two bipartite graphs, by O. Favaron and C. M. Mynhardt. Before entering the path decomposition, star decomposition, and crown decomposition, we consider the decomposition of bipartite graphs in [9]. Suppose that G is a bipartite graph with bipartition (X, Y ), where X = {x 1 , x 2 , .…”
Section: Preliminariesmentioning
confidence: 99%
“…We will use the following theorem on the least common multiple of two bipartite graphs, by O. Favaron and C. M. Mynhardt. Before entering the path decomposition, star decomposition, and crown decomposition, we consider the decomposition of bipartite graphs in [9]. Suppose that G is a bipartite graph with bipartition (X, Y ), where X = {x 1 , x 2 , .…”
Section: Preliminariesmentioning
confidence: 99%