ویراساینس.
سند علمی

Decomposing toroidal graphs into circuits and edges

Baogang Xu, Lusheng Wang

چکیده

Erdős et al. (Canad. J. Math. 18 (1966) 106–112) conjecture that there exists a constant dce such that every simple graph on n vertices can be decomposed into at most dcen circuits and edges. We consider toroidal graphs, where the graphs can be embedded on the torus, and give a polynomial time algorithm to decompose the edge set of an even toroidal graph on n vertices into at most (n + 3)/2 circuits. As a corollary, we get a polynomial time algorithm to decompose the edge set of a toroidal graph (not necessarily even) on n vertices into at most 3(n− 1)/2 circuits and edges. This settles the conjecture for toroidal graphs. © 2005 Elsevier B.V. All rights reserved.

اسناد مشابه

  • Decomposing toroidal graphs into circuits and edges

    مقاله‌ی دسترسی آزاد۲۰۰۵Discrete Applied MathematicsBaogangXu, LushengWang

  • Decomposing Meeting Graph Circuits to Minimise Kernel Loop Unrolling

    سند علمی۲۰۱۱Mounira Bachir, Albert Cohen

    This article studies an important open problem in backend compilation regarding loop unrolling after periodic register allocation. Although software pipelining is a powerful technique to extract fine-grain parallelism, variables can stay alive across more than one kernel iteratio

  • Edge Partition of Toroidal Graphs into Forests in Linear Time

    سند علمی۲۰۰۵Electronic Notes in Discrete MathematicsNicolas Bonichon, Cyril Gavoille, Arnaud Labourel

    In this paper we give a linear algorithm to edge partition a toroidal graph, i.e., graph that can be embedded on the orientable surface of genus one without edge crossing, into three forests plus a set of at most three edges. For triangulated toroidal graphs, this algorithm gives

  • Triangle-Partitioning Edges of Planar Graphs, Toroidal Graphs and k-Planar Graphs

    سند علمی۲۰۱۳WALCOMJiawei Gao, Ton Kloks, Sheung-Hung Poon

    We show that there is a linear-time algorithm to partition the edges of a planar graph into triangles. We show that the problem is also polynomial for toroidal graphs but NP-complete for k-planar graphs, where k > 8.

  • Decomposing Random Graphs into Few Cycles and Edges

    سند علمی۲۰۱۵Combinatorics, Probability & ComputingDániel Korándi, Michael Krivelevich, Benny Sudakov

    Over 50 years ago, Erdős and Gallai conjectured that the edges of every graph on n vertices can be decomposed into O(n) cycles and edges. Among other results, Conlon, Fox and Sudakov recently proved that this holds for the random graph G(n, p) with probability approaching 1 as n

  • Vertex arboricity of toroidal graphs with a forbidden cycle

    سند علمی۲۰۱۴Discrete MathematicsIlkyoo Choi, Haihui Zhang

    The vertex arboricity a(G) of a graph G is the minimum k such that V (G) can be partitioned into k sets where each set induces a forest. For a planar graph G, it is known that a(G) ≤ 3. In two recent papers, it was proved that planar graphs without k-cycles for some k ∈ {3, 4, 5,