2,559 research outputs found

    Decomposing Cubic Graphs into Connected Subgraphs of Size Three

    Get PDF
    Let S={K1,3,K3,P4}S=\{K_{1,3},K_3,P_4\} be the set of connected graphs of size 3. We study the problem of partitioning the edge set of a graph GG into graphs taken from any non-empty S′⊆SS'\subseteq S. The problem is known to be NP-complete for any possible choice of S′S' in general graphs. In this paper, we assume that the input graph is cubic, and study the computational complexity of the problem of partitioning its edge set for any choice of S′S'. We identify all polynomial and NP-complete problems in that setting, and give graph-theoretic characterisations of S′S'-decomposable cubic graphs in some cases.Comment: to appear in the proceedings of COCOON 201

    Construction of cycle double covers for certain classes of graphs

    Get PDF
    We introduce two classes of graphs, Indonesian graphs and kk-doughnut graphs. Cycle double covers are constructed for these classes. In case of doughnut graphs this is done for the values k=1,2,3k=1,2,3 and 4
    • …
    corecore