Results 31 to 40 of about 58,065 (305)
Optimizing tree decompositions in MSO [PDF]
Logical Methods in Computer Science, 2022 The classic algorithm of Bodlaender and Kloks [J. Algorithms, 1996] solves the following problem in linear fixed-parameter time: given a tree decomposition of a graph of (possibly suboptimal) width k, compute an optimum-width tree decomposition of the ...
Mikołaj Bojańczyk, Michał Pilipczuk
doaj +1 more source
Genus Distribution for a Graph [PDF]
, 2009 In this paper we develop the technique of a distribution decomposition for a graph. A formula is given to determine genus distribution of a cubic graph.
Liangxia, Wan +2 more
core +1 more source
Independent sets of maximum weight in apple-free graphs [PDF]
, 2010 We present the first polynomial-time algorithm to solve the maximum weight independent set problem for apple-free graphs, which is a common generalization of several important classes where the problem can be solved efficiently, such as claw-free graphs,
Lozin, Vadim V. +2 more
core +1 more source
Local Balance in Graph Decompositions [PDF]
Graphs and Combinatorics, 2022 In a balanced graph decomposition, every vertex of the host graph appears in the same number of blocks. We propose the use of colored loops as a framework for unifying various other types of local balance conditions in graph decompositions. In the basic case where a single graph with colored loops is used as a block, an existence theory for such ...
Flora C. Bowditch, Peter J. Dukes
openaire +2 more sources
Labeling, Covering and Decomposing of Graphs — Smarandache’s Notion in Graph Theory [PDF]
, 2010 This paper surveys the applications of Smarandache’s notion to graph theory appeared in International J.Math.Combin. from Vol.1,2008 to Vol.3,2009.
Mao, Linfan, Linfan Mao
core +1 more source
Decomposition of complete graphs into connected unicyclic graphs with eight edges and pentagon
Indonesian Journal of Combinatorics, 2019 A G-decomposition of the complete graph Kn is a family of pairwise edge disjoint subgraphs of Kn, all isomorphic to G, such that every edge of Kn belongs to exactly one copy of G.
Dalibor Froncek, O'Neill Kingston
doaj +1 more source
Fast Spectral Approximation of Structured Graphs with Applications to Graph Filtering
Algorithms, 2020 To analyze and synthesize signals on networks or graphs, Fourier theory has been extended to irregular domains, leading to a so-called graph Fourier transform.
Mario Coutino +3 more
doaj +1 more source
Decomposition of hypercube graphs into paths and cycles of length four
AKCE International Journal of Graphs and Combinatorics, 2022 By a [Formula: see text]-decomposition of a graph G, we mean a partition of the edge set of G into p paths of length 4 and q cycles of length 4. In this paper, we give conditions for a [Formula: see text]-decomposition of the n-dimensional hypercube ...
D. Saranya, S. Jeevadoss
doaj +1 more source
ON P4-DECOMPOSITION OF GRAPHS [PDF]
Taiwanese Journal of Mathematics, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
The Balanced Decomposition Number of TK4 and Series-Parallel Graphs
Discussiones Mathematicae Graph Theory, 2013 A balanced colouring of a graph G is a colouring of some of the vertices of G with two colours, say red and blue, such that there is the same number of vertices in each colour. The balanced decomposition number f(G) of G is the minimum integer s with the
Fujita Shinya, Liu Henry
doaj +1 more source