Finding good 2-partitions of digraphs II. Enumerable properties
暂无分享,去创建一个
[1] Nicolas Lichiardopol. Vertex-Disjoint Subtournaments of Prescribed Minimum Outdegree or Minimum Semidegree: Proof for Tournaments of a Conjecture of Stiebi , 2012 .
[2] Jørgen Bang-Jensen,et al. Arc-disjoint spanning sub(di)graphs in digraphs , 2012, Theor. Comput. Sci..
[3] Carsten Thomassen. Graph decomposition with constraints on the connectivity and minimum degree , 1983, J. Graph Theory.
[4] Wayne Goddard,et al. Defective coloring revisited , 1997, J. Graph Theory.
[5] K. B. Reid,et al. Two Complementary Circuits in Two-Connected Tournaments , 1985 .
[6] Julien Bensmail,et al. On the complexity of partitioning a graph into a few connected subgraphs , 2015, J. Comb. Optim..
[7] Daniela Kühn,et al. Proof of a tournament partition conjecture and an application to 1-factors with prescribed cycle lengths , 2016, Comb..
[8] Russell Merris,et al. Split graphs , 2003, Eur. J. Comb..
[9] Van Bang Le,et al. Splitting a graph into disjoint induced paths or cycles , 2003, Discret. Appl. Math..
[10] Ken-ichi Kawarabayashi,et al. The Directed Grid Theorem , 2015, STOC.
[11] Jørgen Bang-Jensen,et al. Vertex-disjoint directed and undirected cycles in general digraphs , 2011, J. Comb. Theory, Ser. B.
[12] Stéphan Thomassé,et al. On spanning galaxies in digraphs , 2012, Discret. Appl. Math..
[13] Gregory Gutin,et al. Digraphs - theory, algorithms and applications , 2002 .
[14] Jørgen Bang-Jensen,et al. On the problem of finding disjoint cycles and dicycles in a digraph , 2011, Comb..
[15] Geevarghese Philip,et al. FPT algorithms for Connected Feedback Vertex Set , 2009, Journal of Combinatorial Optimization.
[16] Noga Alon. Splitting digraphs , 2006, Comb. Probab. Comput..
[17] Gerhard J. Woeginger,et al. Partitioning graphs into connected parts , 2009, Theor. Comput. Sci..
[18] Péter Hajnal. Partition of graphs with condition on the connectivity and minimum degree , 1983, Comb..
[19] Thomas J. Schaefer,et al. The complexity of satisfiability problems , 1978, STOC.
[20] Martin E. Dyer,et al. On the complexity of partitioning graphs into connected subgraphs , 1985, Discret. Appl. Math..
[21] Takao Nishizeki,et al. A Linear Algorithm for Bipartition of Biconnected Graphs , 1990, Inf. Process. Lett..
[22] Bojan Mohar,et al. The circular chromatic number of a digraph , 2004, J. Graph Theory.
[23] Jørgen Bang-Jensen,et al. Finding a subdivision of a digraph , 2015, Theor. Comput. Sci..
[24] William McCuaig,et al. Intercyclic digraphs , 1991, Graph Structure Theory.
[25] Daniela Kühn,et al. Partitions of graphs with high minimum degree or connectivity , 2003, J. Comb. Theory, Ser. B.
[26] Wayne Goddard,et al. Even Cycles in Directed Graphs , 1994, SIAM J. Discret. Math..
[27] Alexander Grigoriev,et al. Connected Feedback Vertex Set in Planar Graphs , 2009, WG.
[28] Jørgen Bang-Jensen,et al. Finding good 2-partitions of digraphs I. Hereditary properties , 2016, Theor. Comput. Sci..
[29] Baogang Xu,et al. Bipartition of graph under degree constraints , 2015 .