Results 1 to 10 of about 818,578 (247)
Algorithms for generalized vertex-rankings of partial k-trees
Theoretical Computer Science, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Md. Abul Kashem +2 more
openalex +3 more sources
The complexity of subgraph isomorphism for classes of partial k-trees
Theoretical Computer Science, 1996 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Arvind Gupta, Naomi Nishimura
openalex +4 more sources
Transversals of Longest Cycles in Partial $k$-Trees and Chordal Graphs [PDF]
Journal of Graph Theory, 2019 AbstractLet be the minimum cardinality of a set of vertices that intersects every longest cycle of a 2‐connected graph . We show that if is a partial ‐tree and that if is chordal, where is the cardinality of a maximum clique in . Those results imply that all longest cycles intersect in 2‐connected series‐parallel graphs and in 3‐trees.
Juan Gutiérrez
openalex +5 more sources
On some optimization problems on k-trees and partial k-trees
Discrete Applied Mathematics, 1994 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Daniel Granot, Darko Skorin‐Kapov
openalex +3 more sources
Efficient sets in partial k-trees
Discrete Applied Mathematics, 1993 The efficiency of a graph is the maximum number of vertices uniquely dominated by a subset of vertices in the graph. In this paper, a linear time algorithm is developed for finding the efficiency of a partial \(k\)- tree given its embedding in a \(k\)-tree.
Jan Arne Telle, Andrzej Proskurowski
openalex +4 more sources
The inverse inertia problem for the complements of partial k -trees
Linear Algebra and its Applications, 2013 10 ...
Hein van der Holst
openalex +4 more sources
On the complexity of finding iso- and other morphisms for partial k-trees
Discrete Mathematics, 1992 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jiřı́ Matoušek, Robin Thomas
openalex +3 more sources
Counting H-Colorings of Partial k-Trees [PDF]
Theoretical Computer Science, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Josep Dı́az +2 more
openalex +3 more sources
Maximum packing for k-connected partial k-trees in polynomial time
Theoretical Computer Science, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Anders Dessmark +2 more
openalex +4 more sources
Completely independent spanning trees in (partial) k-trees
Discussiones Mathematicae Graph Theory, 2015 Two spanning trees T1 and T2 of a graph G are completely independent if, for any two vertices u and v, the paths from u to v in T1 and T2 are internally disjoint. For a graph G, we denote the maximum number of pairwise completely independent spanning trees by cist(G). In this paper, we consider cist(G) when G is a partial k-tree.
Toru Araki, M. Matsushita, Yota Otachi
openalex +4 more sources