In this paper we give a necessary and sufficient condition for the decomposability of a multigraph into two odd subgraphs. We also present a polynomial time algorithm for finding such a decomposition or showing its non-existence. We also deal with the case of the decomposability into an even ...
A bidirected graph is a graph each arc of which has either two positive end-vertices (tails), two negative end-vertices (heads), or one positive end-vertex (a tail) and one negative end-vertex (a head). We define the strong connectivity of a bidirected graph as a generalization of the...
这个专题主要讲解图分解的问题。 注:在极值组合意义下的讨论源于 Glock, Kuhn, and Osthus 的综述文章 Extremal aspects of graph and hypergraph decomposition problems[1]*** 系列1 为介绍图分…
Publication » Decomposition of Finite Graphs Into Forests. CSJA Nash-Williams - 《Journal of the London Mathematical Society》 被引量: 764发表: 1964年 Core decomposition of uncertain graphs Core decomposition has proven to be a useful primitive for a wide range of graph analyses. One of its...
The V-functions of Tutte [1] are generalized to U-functions on graphs with a distinguished subset of vertices. The class of U-functions of two variables generalize dichromatic polynomials as well as the W-functions defined by Tutte [2]. The values of U-functions on a graph G are character...
A path decomposition of a graph G is a set of edge-disjoint paths of G that covers the edge set of G. Gallai (1968) conjectured that every connected graph with n vertices admits a path decomposition of size at most [(n+1)/2] RIGHT FLOOR. Gallai's conjecture was verified for many ...
1) graph decomposition 图的分裂 2) Matrix of a graph 图的矩阵 3) circumference of a graph 图的周长 4) graph search 图的搜索 5) graph coloring 图的着色 1. The k-Graph Coloring procedure was introduced. 图的着色问题是一典型的优化的问题,用蚂蚁算法求解图着色问题,可保证程序运行的高效率及高...
Babel, L., Olariu, S. (1997). On the separable-homogeneous decomposition of graphs. In: Möhring, R.H. (eds) Graph-Theoretic Concepts in Computer Science. WG 1997. Lecture Notes in Computer Science, vol 1335. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024485 ...
I f X c v(G> t h ; b G [x] we denote the subgraph of G induced by ths v e r t i c e s ic. X. In t h i s paper we deal w i th problems r e l a t e d to graph d e conpop i t ionc . By a decomposit ion of a graph G we mean a family of adgs d...
Let Cand Sdenote a cycle and a star on m edges, respectively. We investigate the decomposition of the complete graphs, K, into cycles and stars on the same... AA Abueida,C Lian - 《Discussiones Mathematicae Graph Theory》 被引量: 4发表: 2013年 DECOMPOSITION OF TENSOR PRODUCT OF COMPLETE...