Results 181 to 190 of about 855,011 (194)

Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees

, 1990
Hans L. Bodlaender
openalex   +1 more source

Characterizations of k-Terminal Flow Networks and Computing Network Flows in Partial k-Trees

, 1995
Torben Hagerup, Jyrki Katajainen, Naomi Nishimura, Prabhakar Ragde   +3 more
openalex   +1 more source

Lower bounds for the game colouring number of partial k-trees and planar graphs

, 2007
Jiaojiao Wu, Xuding Zhu
openalex   +1 more source

On the Complexity of the Maximum Common Subgraph Problem for Partial k-Trees of Bounded Degree

, 2012
Tatsuya Akutsu, Takeyuki Tamura
openalex   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Algorithms for finding f-colorings of partial k-trees

1995
Xiao Zhou, Takao Nishizeki
openaire   +1 more source

Finding the Maximum Common Subgraph of a Partial k-Tree and a Graph with a Polynomially Bounded Number of Spanning Trees

, 2003
Atsuko Yamaguchi, Hiroshi Mamitsuka
openalex   +1 more source

Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial k-trees

, 2006
Martin Charles Golumbic, Aviad Mintz, Udi Rotics   +2 more
openalex   +1 more source

On Zagreb indices and spectral radius of partial k-trees.

, 2018
Xiaoxia Ke, Bo Zhou
openalex  

Memory requirements for table computations in partial k-tree algorithms

, 1998
Bengt Aspvall, Andrzej Proskurowski, Jan Arne Telle   +2 more
openalex   +1 more source

Sequential and parallel algorithms for embedding problems on classes of partial k-trees

, 1994
Arvind Gupta, Naomi Nishimura
openalex   +1 more source