{"title":"半完整数图中的弧-不相连外分支和内分支","authors":"J. Bang-Jensen, Y. Wang","doi":"10.1002/jgt.23072","DOIUrl":null,"url":null,"abstract":"<p>An out-branching <math>\n <semantics>\n <mrow>\n <msubsup>\n <mi>B</mi>\n \n <mi>u</mi>\n \n <mo>+</mo>\n </msubsup>\n </mrow>\n <annotation> ${B}_{u}^{+}$</annotation>\n </semantics></math> (in-branching <math>\n <semantics>\n <mrow>\n <msubsup>\n <mi>B</mi>\n \n <mi>u</mi>\n \n <mo>−</mo>\n </msubsup>\n </mrow>\n <annotation> ${B}_{u}^{-}$</annotation>\n </semantics></math>) in a digraph <math>\n <semantics>\n <mrow>\n <mi>D</mi>\n </mrow>\n <annotation> $D$</annotation>\n </semantics></math> is a connected spanning subdigraph of <math>\n <semantics>\n <mrow>\n <mi>D</mi>\n </mrow>\n <annotation> $D$</annotation>\n </semantics></math> in which every vertex except the vertex <math>\n <semantics>\n <mrow>\n <mi>u</mi>\n </mrow>\n <annotation> $u$</annotation>\n </semantics></math>, called the root, has in-degree (out-degree) one. It is well known that there exists a polynomial algorithm for deciding whether a given digraph has <math>\n <semantics>\n <mrow>\n <mi>k</mi>\n </mrow>\n <annotation> $k$</annotation>\n </semantics></math> arc-disjoint out-branchings with prescribed roots (<math>\n <semantics>\n <mrow>\n <mi>k</mi>\n </mrow>\n <annotation> $k$</annotation>\n </semantics></math> is part of the input). In sharp contrast to this, it is already NP-complete to decide if a digraph has one out-branching which is arc-disjoint from some in-branching. A digraph is <i>semicomplete</i> if it has no pair of nonadjacent vertices. A <i>tournament</i> is a semicomplete digraph without directed cycles of length 2. In this paper we give a complete classification of semicomplete digraphs that have an out-branching <math>\n <semantics>\n <mrow>\n <msubsup>\n <mi>B</mi>\n \n <mi>u</mi>\n \n <mo>+</mo>\n </msubsup>\n </mrow>\n <annotation> ${B}_{u}^{+}$</annotation>\n </semantics></math> which is arc-disjoint from some in-branching <math>\n <semantics>\n <mrow>\n <msubsup>\n <mi>B</mi>\n \n <mi>v</mi>\n \n <mo>−</mo>\n </msubsup>\n </mrow>\n <annotation> ${B}_{v}^{-}$</annotation>\n </semantics></math> where <math>\n <semantics>\n <mrow>\n <mi>u</mi>\n \n <mo>,</mo>\n \n <mi>v</mi>\n </mrow>\n <annotation> $u,v$</annotation>\n </semantics></math> are prescribed vertices of <math>\n <semantics>\n <mrow>\n <mi>D</mi>\n </mrow>\n <annotation> $D$</annotation>\n </semantics></math>. Our characterization, which is surprisingly simple, generalizes a complicated characterization for tournaments from 1991 by the first author and our proof implies the existence of a polynomial algorithm for checking whether a given semicomplete digraph has such a pair of branchings for prescribed vertices <math>\n <semantics>\n <mrow>\n <mi>u</mi>\n \n <mo>,</mo>\n \n <mi>v</mi>\n </mrow>\n <annotation> $u,v$</annotation>\n </semantics></math> and construct a solution if one exists. This confirms a conjecture of Bang-Jensen for the case of semicomplete digraphs.</p>","PeriodicalId":16014,"journal":{"name":"Journal of Graph Theory","volume":"106 1","pages":"182-197"},"PeriodicalIF":0.9000,"publicationDate":"2024-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Arc-disjoint out-branchings and in-branchings in semicomplete digraphs\",\"authors\":\"J. Bang-Jensen, Y. Wang\",\"doi\":\"10.1002/jgt.23072\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>An out-branching <math>\\n <semantics>\\n <mrow>\\n <msubsup>\\n <mi>B</mi>\\n \\n <mi>u</mi>\\n \\n <mo>+</mo>\\n </msubsup>\\n </mrow>\\n <annotation> ${B}_{u}^{+}$</annotation>\\n </semantics></math> (in-branching <math>\\n <semantics>\\n <mrow>\\n <msubsup>\\n <mi>B</mi>\\n \\n <mi>u</mi>\\n \\n <mo>−</mo>\\n </msubsup>\\n </mrow>\\n <annotation> ${B}_{u}^{-}$</annotation>\\n </semantics></math>) in a digraph <math>\\n <semantics>\\n <mrow>\\n <mi>D</mi>\\n </mrow>\\n <annotation> $D$</annotation>\\n </semantics></math> is a connected spanning subdigraph of <math>\\n <semantics>\\n <mrow>\\n <mi>D</mi>\\n </mrow>\\n <annotation> $D$</annotation>\\n </semantics></math> in which every vertex except the vertex <math>\\n <semantics>\\n <mrow>\\n <mi>u</mi>\\n </mrow>\\n <annotation> $u$</annotation>\\n </semantics></math>, called the root, has in-degree (out-degree) one. It is well known that there exists a polynomial algorithm for deciding whether a given digraph has <math>\\n <semantics>\\n <mrow>\\n <mi>k</mi>\\n </mrow>\\n <annotation> $k$</annotation>\\n </semantics></math> arc-disjoint out-branchings with prescribed roots (<math>\\n <semantics>\\n <mrow>\\n <mi>k</mi>\\n </mrow>\\n <annotation> $k$</annotation>\\n </semantics></math> is part of the input). In sharp contrast to this, it is already NP-complete to decide if a digraph has one out-branching which is arc-disjoint from some in-branching. A digraph is <i>semicomplete</i> if it has no pair of nonadjacent vertices. A <i>tournament</i> is a semicomplete digraph without directed cycles of length 2. In this paper we give a complete classification of semicomplete digraphs that have an out-branching <math>\\n <semantics>\\n <mrow>\\n <msubsup>\\n <mi>B</mi>\\n \\n <mi>u</mi>\\n \\n <mo>+</mo>\\n </msubsup>\\n </mrow>\\n <annotation> ${B}_{u}^{+}$</annotation>\\n </semantics></math> which is arc-disjoint from some in-branching <math>\\n <semantics>\\n <mrow>\\n <msubsup>\\n <mi>B</mi>\\n \\n <mi>v</mi>\\n \\n <mo>−</mo>\\n </msubsup>\\n </mrow>\\n <annotation> ${B}_{v}^{-}$</annotation>\\n </semantics></math> where <math>\\n <semantics>\\n <mrow>\\n <mi>u</mi>\\n \\n <mo>,</mo>\\n \\n <mi>v</mi>\\n </mrow>\\n <annotation> $u,v$</annotation>\\n </semantics></math> are prescribed vertices of <math>\\n <semantics>\\n <mrow>\\n <mi>D</mi>\\n </mrow>\\n <annotation> $D$</annotation>\\n </semantics></math>. Our characterization, which is surprisingly simple, generalizes a complicated characterization for tournaments from 1991 by the first author and our proof implies the existence of a polynomial algorithm for checking whether a given semicomplete digraph has such a pair of branchings for prescribed vertices <math>\\n <semantics>\\n <mrow>\\n <mi>u</mi>\\n \\n <mo>,</mo>\\n \\n <mi>v</mi>\\n </mrow>\\n <annotation> $u,v$</annotation>\\n </semantics></math> and construct a solution if one exists. This confirms a conjecture of Bang-Jensen for the case of semicomplete digraphs.</p>\",\"PeriodicalId\":16014,\"journal\":{\"name\":\"Journal of Graph Theory\",\"volume\":\"106 1\",\"pages\":\"182-197\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2024-01-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Graph Theory\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1002/jgt.23072\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Graph Theory","FirstCategoryId":"100","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/jgt.23072","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
Arc-disjoint out-branchings and in-branchings in semicomplete digraphs
An out-branching (in-branching ) in a digraph is a connected spanning subdigraph of in which every vertex except the vertex , called the root, has in-degree (out-degree) one. It is well known that there exists a polynomial algorithm for deciding whether a given digraph has arc-disjoint out-branchings with prescribed roots ( is part of the input). In sharp contrast to this, it is already NP-complete to decide if a digraph has one out-branching which is arc-disjoint from some in-branching. A digraph is semicomplete if it has no pair of nonadjacent vertices. A tournament is a semicomplete digraph without directed cycles of length 2. In this paper we give a complete classification of semicomplete digraphs that have an out-branching which is arc-disjoint from some in-branching where are prescribed vertices of . Our characterization, which is surprisingly simple, generalizes a complicated characterization for tournaments from 1991 by the first author and our proof implies the existence of a polynomial algorithm for checking whether a given semicomplete digraph has such a pair of branchings for prescribed vertices and construct a solution if one exists. This confirms a conjecture of Bang-Jensen for the case of semicomplete digraphs.
期刊介绍:
The Journal of Graph Theory is devoted to a variety of topics in graph theory, such as structural results about graphs, graph algorithms with theoretical emphasis, and discrete optimization on graphs. The scope of the journal also includes related areas in combinatorics and the interaction of graph theory with other mathematical sciences.
A subscription to the Journal of Graph Theory includes a subscription to the Journal of Combinatorial Designs .