Akutsu, Tatsuya; Melkman, Avraham A.; Tamura, Takeyuki Improved hardness of maximum common subgraph problems on labeled graphs of bounded treewidth and bounded degree. (English) Zbl 1458.68137 Int. J. Found. Comput. Sci. 31, No. 2, 253-273 (2020). MSC: 68R10 05C60 68Q17 PDF BibTeX XML Cite \textit{T. Akutsu} et al., Int. J. Found. Comput. Sci. 31, No. 2, 253--273 (2020; Zbl 1458.68137) Full Text: DOI OpenURL
Selivanov, Victor Well-quasi orders and hierarchy theory. (English) Zbl 1496.03189 Schuster, Peter M. (ed.) et al., Well-quasi orders in computation, logic, language and reasoning. A unifying concept of proof theory, automata theory, formal languages and descriptive set theory. Based on the minisymposium on well-quasi orders: from theory to applications within the Jahrestagung der Deutschen Mathematiker-Vereinigung (DMV), Hamburg, Germany, September 21–25, 2015 and the Dagstuhl seminar 16031 on well quasi-orders in computer science, Schloss Dagstuhl, Germany, January 17–22, 2016. Cham: Springer. Trends Log. Stud. Log. Libr. 53, 271-319 (2020). MSC: 03E15 03E02 03D55 06A06 PDF BibTeX XML Cite \textit{V. Selivanov}, Trends Log. Stud. Log. Libr. 53, 271--319 (2020; Zbl 1496.03189) Full Text: DOI arXiv OpenURL
Drmota, Michael; Jin, Emma Yu; Stufler, Benedikt Graph limits of random graphs from a subset of connected \(k\)-trees. (English) Zbl 1423.05152 Random Struct. Algorithms 55, No. 1, 125-152 (2019). MSC: 05C80 05C05 PDF BibTeX XML Cite \textit{M. Drmota} et al., Random Struct. Algorithms 55, No. 1, 125--152 (2019; Zbl 1423.05152) Full Text: DOI arXiv OpenURL
Calamoneri, Tiziana; Dell’Orefice, Matteo; Monti, Angelo A simple linear time algorithm for the locally connected spanning tree problem on maximal planar chordal graphs. (English) Zbl 1417.68147 Theor. Comput. Sci. 764, 2-14 (2019). MSC: 68R10 05C05 68W40 PDF BibTeX XML Cite \textit{T. Calamoneri} et al., Theor. Comput. Sci. 764, 2--14 (2019; Zbl 1417.68147) Full Text: DOI Link OpenURL
Nishikawa, Kazuhide; Nishizeki, Takao; Zhou, Xiao Bandwidth consecutive multicolorings of graphs. (English) Zbl 1419.05079 Theor. Comput. Sci. 532, 64-72 (2014). MSC: 05C15 05C85 PDF BibTeX XML Cite \textit{K. Nishikawa} et al., Theor. Comput. Sci. 532, 64--72 (2014; Zbl 1419.05079) Full Text: DOI OpenURL
Sen, Sagnik \(L(2,1)\)-labelings of some families of oriented planar graphs. (English) Zbl 1292.05228 Discuss. Math., Graph Theory 34, No. 1, 31-48 (2014). MSC: 05C78 PDF BibTeX XML Cite \textit{S. Sen}, Discuss. Math., Graph Theory 34, No. 1, 31--48 (2014; Zbl 1292.05228) Full Text: DOI OpenURL
Maxová, Jana; Dubcová, Miroslava; Pavlíková, Pavla; Turzík, Daniel Which \(k\)-trees are cover-incomparability graphs? (English) Zbl 1284.05063 Discrete Appl. Math. 167, 222-227 (2014). MSC: 05C05 06A06 PDF BibTeX XML Cite \textit{J. Maxová} et al., Discrete Appl. Math. 167, 222--227 (2014; Zbl 1284.05063) Full Text: DOI OpenURL
Kawabata, Masaki; Nishizeki, Takao Spanning distribution trees of graphs (extended abstract). (English) Zbl 1303.90118 Fellows, Michael (ed.) et al., Frontiers in algorithmics and algorithmic aspects in information and management. Third joint international conference, FAW-AAIM 2013, Dalian, China, June 26–28, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-38755-5/pbk). Lecture Notes in Computer Science 7924, 153-162 (2013). MSC: 90C35 05C21 05C85 68Q17 90B10 PDF BibTeX XML Cite \textit{M. Kawabata} and \textit{T. Nishizeki}, Lect. Notes Comput. Sci. 7924, 153--162 (2013; Zbl 1303.90118) Full Text: DOI OpenURL
Akutsu, Tatsuya; Tamura, Takeyuki On the complexity of the maximum common subgraph problem for partial \(k\)-trees of bounded degree. (English) Zbl 1260.68169 Chao, Kun-Mao (ed.) et al., Algorithms and computation. 23rd international symposium, ISAAC 2012, Taipei, Taiwan, December 19–21, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-35260-7/pbk). Lecture Notes in Computer Science 7676, 146-155 (2012). MSC: 68Q25 05C78 05C85 68Q17 PDF BibTeX XML Cite \textit{T. Akutsu} and \textit{T. Tamura}, Lect. Notes Comput. Sci. 7676, 146--155 (2012; Zbl 1260.68169) Full Text: DOI OpenURL
Nishikawa, Kazuhide; Nishizeki, Takao; Zhou, Xiao Algorithms for bandwidth consecutive multicolorings of graphs (extended abstract). (English) Zbl 1304.05139 Snoeyink, Jack (ed.) et al., Frontiers in algorithmics and algorithmic aspects in information and management. Joint international conference, FAW-AAIM 2012, Beijing, China, May 14–16, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-29699-4/pbk). Lecture Notes in Computer Science 7285, 117-128 (2012). MSC: 05C85 05C15 05C78 PDF BibTeX XML Cite \textit{K. Nishikawa} et al., Lect. Notes Comput. Sci. 7285, 117--128 (2012; Zbl 1304.05139) Full Text: DOI OpenURL
Yang, Daqing Coloring games on squares of graphs. (English) Zbl 1241.05093 Discrete Math. 312, No. 8, 1400-1406 (2012). MSC: 05C57 91A43 05C15 PDF BibTeX XML Cite \textit{D. Yang}, Discrete Math. 312, No. 8, 1400--1406 (2012; Zbl 1241.05093) Full Text: DOI OpenURL
Bykova, V. V. Computational aspects of treewidth for graph. (Russian. English summary) Zbl 1483.68251 Prikl. Diskretn. Mat. 2011, No. 3(13), 65-79 (2011). MSC: 68R10 05C85 PDF BibTeX XML Cite \textit{V. V. Bykova}, Prikl. Diskretn. Mat. 2011, No. 3(13), 65--79 (2011; Zbl 1483.68251) Full Text: MNR OpenURL
Yamada, Takashi; Shoudai, Takayoshi Efficient pattern matching on graph patterns of bounded treewidth. (English) Zbl 1268.05217 Bonomo, Flavia (ed.) et al., LAGOS’11 – VI Latin-American algorithms, graphs, and optimization symposium. Extended abstracts from the symposium, Bariloche, Argentina, March 28–April 1, 2011. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 37, 117-122 (2011). MSC: 05C85 PDF BibTeX XML Cite \textit{T. Yamada} and \textit{T. Shoudai}, Electron. Notes Discrete Math. 37, 117--122 (2011; Zbl 1268.05217) Full Text: DOI OpenURL
Montejano, Amanda; Ochem, Pascal; Pinlou, Alexandre; Raspaud, André; Sopena, Éric Homomorphisms of 2-edge-colored graphs. (English) Zbl 1221.05156 Discrete Appl. Math. 158, No. 12, 1365-1379 (2010). MSC: 05C15 05C10 05C60 PDF BibTeX XML Cite \textit{A. Montejano} et al., Discrete Appl. Math. 158, No. 12, 1365--1379 (2010; Zbl 1221.05156) Full Text: DOI OpenURL
Ito, Takehiro; Zhou, Xiao; Nishizeki, Takao Partitioning graphs of supply and demand. (English) Zbl 1211.05129 Discrete Appl. Math. 157, No. 12, 2620-2633 (2009). MSC: 05C70 05C90 05C85 PDF BibTeX XML Cite \textit{T. Ito} et al., Discrete Appl. Math. 157, No. 12, 2620--2633 (2009; Zbl 1211.05129) Full Text: DOI OpenURL
Narayanaswamy, N. S.; Sadagopan, N.; Chandran, L. Sunil On the structure of contractible edges in \(k\)-connected partial \(k\)-trees. (English) Zbl 1189.05088 Graphs Comb. 25, No. 4, 557-569 (2009). Reviewer: Martin Knor (Bratislava) MSC: 05C40 PDF BibTeX XML Cite \textit{N. S. Narayanaswamy} et al., Graphs Comb. 25, No. 4, 557--569 (2009; Zbl 1189.05088) Full Text: DOI OpenURL
Feng, Aifen; Huang, Zhiyong Tree-width of product of a connected graph and a \(k\)-connected partial \(k\)-tree. (Chinese. English summary) Zbl 1174.05328 J. Henan Univ. Sci. Technol., Nat. Sci. 29, No. 1, 78-79 (2008). MSC: 05C05 05C40 PDF BibTeX XML Cite \textit{A. Feng} and \textit{Z. Huang}, J. Henan Univ. Sci. Technol., Nat. Sci. 29, No. 1, 78--79 (2008; Zbl 1174.05328) OpenURL
Escoffier, Bruno; Monnot, Jérôme; Paschos, Vangelis Th. Weighted coloring: further complexity and approximability results. (English) Zbl 1181.68173 Inf. Process. Lett. 97, No. 3, 98-103 (2006). MSC: 68R10 05C15 05C35 05C70 68Q25 68W25 PDF BibTeX XML Cite \textit{B. Escoffier} et al., Inf. Process. Lett. 97, No. 3, 98--103 (2006; Zbl 1181.68173) Full Text: DOI Link OpenURL
Ito, Takehiro; Zhou, Xiao; Nishizeki, Takao Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size. (English) Zbl 1128.68076 J. Discrete Algorithms 4, No. 1, 142-154 (2006). MSC: 68R10 05C70 68Q17 68Q25 PDF BibTeX XML Cite \textit{T. Ito} et al., J. Discrete Algorithms 4, No. 1, 142--154 (2006; Zbl 1128.68076) Full Text: DOI OpenURL
Franceschini, Gianni; Luccio, Fabrizio; Pagli, Linda Dense trees: a new look at degenerate graphs. (English) Zbl 1103.05085 J. Discrete Algorithms 4, No. 3, 455-474 (2006). Reviewer: Haiko Müller (Leeds) MSC: 05C85 05C05 05C35 PDF BibTeX XML Cite \textit{G. Franceschini} et al., J. Discrete Algorithms 4, No. 3, 455--474 (2006; Zbl 1103.05085) Full Text: DOI OpenURL
Escoffier, Bruno; Monnot, Jérôme; Paschos, Vangelis Th. Weighted coloring: Further complexity and approximability results. (English) Zbl 1171.68611 Coppo, Mario (ed.) et al., Theoretical computer science. 9th Italian conference, ICTCS 2005, Siena, Italy, October 12–14, 2005. Proceedings. Berlin: Springer (ISBN 3-540-29106-7/pbk). Lecture Notes in Computer Science 3701, 205-214 (2005). MSC: 68R10 05C15 05C35 05C70 68Q25 68W25 PDF BibTeX XML Cite \textit{B. Escoffier} et al., Lect. Notes Comput. Sci. 3701, 205--214 (2005; Zbl 1171.68611) Full Text: DOI OpenURL
Semanišin, Gabriel Minimal reducible bounds for induced-hereditary properties. (English) Zbl 1055.05065 Discrete Math. 286, No. 1-2, 163-170 (2004). Reviewer: Jozef Fiamčik (Prešov) MSC: 05C15 05C75 PDF BibTeX XML Cite \textit{G. Semanišin}, Discrete Math. 286, No. 1--2, 163--170 (2004; Zbl 1055.05065) Full Text: DOI OpenURL
Yamada, T.; Nomura, K.; Ueno, S. Sparse networks tolerating random faults. (English) Zbl 1066.68008 Discrete Appl. Math. 137, No. 2, 223-235 (2004). MSC: 68M15 05C25 05C05 PDF BibTeX XML Cite \textit{T. Yamada} et al., Discrete Appl. Math. 137, No. 2, 223--235 (2004; Zbl 1066.68008) Full Text: DOI OpenURL
Chlebíková, Janka Partial \(k\)-trees with maximum chromatic number. (English) Zbl 1008.05032 Discrete Math. 259, No. 1-3, 269-276 (2002). MSC: 05C05 05C15 PDF BibTeX XML Cite \textit{J. Chlebíková}, Discrete Math. 259, No. 1--3, 269--276 (2002; Zbl 1008.05032) Full Text: DOI OpenURL
Bodlaender, H. L.; van Antwerpen-de Fluiter, B. Parallel algorithms for series parallel graphs and graphs with treewidth two. (English) Zbl 0979.05095 Algorithmica 29, No. 4, 534-559 (2001). Reviewer: Haiko Müller (Leeds) MSC: 05C85 68R10 68W10 68Q25 05C62 05C70 PDF BibTeX XML Cite \textit{H. L. Bodlaender} and \textit{B. van Antwerpen-de Fluiter}, Algorithmica 29, No. 4, 534--559 (2001; Zbl 0979.05095) Full Text: DOI OpenURL
Bodlaender, Hans L. The algorithmic theory of treewidth. (English) Zbl 1412.05183 Rusu, Irena (ed.), Proceedings of the 6th international conference on graph theory, Marseille-Luminy, France, August 28–September 2, 2000. Amsterdam: Elsevier. Electron. Notes Discrete Math. 5, 27-30 (2000). MSC: 05C85 05C12 05C10 68Q17 PDF BibTeX XML Cite \textit{H. L. Bodlaender}, Electron. Notes Discrete Math. 5, 27--30 (2000; Zbl 1412.05183) Full Text: Link OpenURL
Zhou, X.; Fuse, K.; Nishizeki, T. A linear algorithm for finding \([g,f]\)-colorings of partial \(k\)-trees. (English) Zbl 0971.05048 Algorithmica 27, No. 3-4, 227-243 (2000). Reviewer: Marek Kubale (Gdańsk) MSC: 05C15 05C85 05C05 PDF BibTeX XML Cite \textit{X. Zhou} et al., Algorithmica 27, No. 3--4, 227--243 (2000; Zbl 0971.05048) Full Text: DOI OpenURL
Zhou, X.; Tamura, S.; Nishizeki, T. Finding edge-disjoint paths in partial \(k\)-trees. (English) Zbl 0951.68100 Algorithmica 26, No. 1, 3-30 (2000). Reviewer: Klaus Dohmen (Berlin) MSC: 68R10 68W05 PDF BibTeX XML Cite \textit{X. Zhou} et al., Algorithmica 26, No. 1, 3--30 (2000; Zbl 0951.68100) Full Text: DOI OpenURL
Isobe, Shuji; Zhou, Xiao; Nishizeki, Takao A polynomial-time algorithm for finding total colorings of partial \(k\)-trees. (English) Zbl 1320.05123 Int. J. Found. Comput. Sci. 10, No. 2, 171-194 (1999). MSC: 05C85 05C05 05C15 68W40 PDF BibTeX XML Cite \textit{S. Isobe} et al., Int. J. Found. Comput. Sci. 10, No. 2, 171--194 (1999; Zbl 1320.05123) Full Text: DOI OpenURL
Bodlaender, Hans L. A partial k-arboretum of graphs with bounded treewidth. (English) Zbl 0912.68148 Theor. Comput. Sci. 209, No. 1-2, 1-45 (1998). MSC: 68R10 PDF BibTeX XML Cite \textit{H. L. Bodlaender}, Theor. Comput. Sci. 209, No. 1--2, 1--45 (1998; Zbl 0912.68148) Full Text: DOI OpenURL
Bodlaender, Hans L.; Hagerup, Torben Parallel algorithms with optimal speedup for bounded treewidth. (English) Zbl 0907.68089 SIAM J. Comput. 27, No. 6, 1725-1746 (1998). MSC: 68W10 68Q25 68R10 05C05 05C85 68W15 PDF BibTeX XML Cite \textit{H. L. Bodlaender} and \textit{T. Hagerup}, SIAM J. Comput. 27, No. 6, 1725--1746 (1998; Zbl 0907.68089) Full Text: DOI OpenURL
Kashem, Md. Abul; Zhou, Xiao; Nishizeki, Takao Generalized vertex-rankings of partial \(k\)-trees. (Extended abstract). (English) Zbl 0883.05118 Jiang, Tao (ed.) et al., Computing and combinatorics. 3rd annual international conference, COCOON ’97. Shanghai, China. August 20–22, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1276, 212-221 (1997). Reviewer: H.Müller (Jena) MSC: 05C85 05C05 05C78 68R10 PDF BibTeX XML Cite \textit{Md. A. Kashem} et al., Lect. Notes Comput. Sci. 1276, 212--221 (1997; Zbl 0883.05118) OpenURL
Borie, Richard; Gupta, Arobinda Balanced decompositions for partial \(k\)-trees. (English) Zbl 0803.05044 Congr. Numerantium 98, 33-38 (1993). Reviewer: H.L.Bodlaender MSC: 05C70 05C05 05C85 68W15 PDF BibTeX XML Cite \textit{R. Borie} and \textit{A. Gupta}, Congr. Numerantium 98, 33--38 (1993; Zbl 0803.05044) OpenURL
Proskurowski, Andrzej Graph reductions, and techniques for finding minimal forbidden minors. (English) Zbl 0787.05032 Robertson, Neil (ed.) et al., Graph structure theory. Proceedings of the AMS-IMS-SIAM joint summer research conference on graph minors held June 22 to July 5, 1991 at the University of Washington, Seattle, WA (USA). Providence, RI: American Mathematical Society. Contemp. Math. 147, 591-600 (1993). Reviewer: C.J.Colbourn (Waterloo / Ontario) MSC: 05C10 05C75 PDF BibTeX XML Cite \textit{A. Proskurowski}, Contemp. Math. 147, 591--600 (1993; Zbl 0787.05032) OpenURL
Telle, Jan Arne; Proskurowski, Andrzej Efficient sets in partial \(k\)-trees. (English) Zbl 0787.68083 Discrete Appl. Math. 44, No. 1-3, 109-117 (1993). Reviewer: C.J.Colbourn (Waterloo / Ontario) MSC: 68R10 05C05 05C10 PDF BibTeX XML Cite \textit{J. A. Telle} and \textit{A. Proskurowski}, Discrete Appl. Math. 44, No. 1--3, 109--117 (1993; Zbl 0787.68083) Full Text: DOI OpenURL
Matoušek, Jiří; Thomas, Robin On the complexity of finding iso- and other morphisms for partial \(k\)- trees. (English) Zbl 0764.68128 Discrete Math. 108, No. 1-3, 343-364 (1992). MSC: 68R10 68Q25 05C05 05C10 05C70 05C38 PDF BibTeX XML Cite \textit{J. Matoušek} and \textit{R. Thomas}, Discrete Math. 108, No. 1--3, 343--364 (1992; Zbl 0764.68128) Full Text: DOI OpenURL
Mata-Montero, Erick Resilience of partial \(k\)-tree networks with edge and node failures. (English) Zbl 0738.90029 Networks 21, No. 3, 321-344 (1991). Reviewer: A.Pasculescu (Bucureşti) MSC: 90B18 90B25 90-08 90C60 PDF BibTeX XML Cite \textit{E. Mata-Montero}, Networks 21, No. 3, 321--344 (1991; Zbl 0738.90029) Full Text: DOI OpenURL
Satyanarayana, A.; Tung, L. A characterization of partial 3-trees. (English) Zbl 0701.90092 Networks 20, No. 3, 299-322 (1990). Reviewer: M.Savelsbergh MSC: 90C35 05C05 PDF BibTeX XML Cite \textit{A. Satyanarayana} and \textit{L. Tung}, Networks 20, No. 3, 299--322 (1990; Zbl 0701.90092) Full Text: DOI OpenURL
El-Mallah, Ehab S.; Colbourn, Charles J. Partial k-tree algorithms. (English) Zbl 0668.68076 Graph theory, 250th Anniv. Conf., Lafayette/Indiana 1986, Congr. Numerantium 64, 105-119 (1988). MSC: 68R10 05C05 PDF BibTeX XML OpenURL
Bodlaender, Hans L. Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees. (English) Zbl 0651.68079 Algorithm theory, Proc. 1st Scand. Workshop, Halmstad/Sweden 1988, Lect. Notes Comput. Sci. 318, 223-232 (1988). MSC: 68R10 68Q25 PDF BibTeX XML OpenURL
Bodlaender, Hans L. Dynamic programming on graphs with bounded treewidth. (English) Zbl 0649.68039 Automata, languages and programming, Proc. 15th Int. Colloq., Tampere/Finn. 1988, Lect. Notes Comput. Sci. 317, 105-118 (1988). MSC: 68Q25 68R10 68T20 PDF BibTeX XML OpenURL
Arnborg, Stefan; Proskurowski, Andrzej Algorithms on graphs with bounded decomposability. (English) Zbl 0626.05047 Combinatorics, graph theory, and computing, Proc. 17th Southeast. Conf., Boca Raton/Fl. 1986, Congr. Numerantium 53, 167-170 (1986). Reviewer: G.Slutzki MSC: 05C75 05C05 68R99 PDF BibTeX XML OpenURL
Kajitani, Yoji; Ishizuka, Akio; Ueno, Shuichi Characterization of partial 3-trees in terms of three structures. (English) Zbl 0609.05030 Graphs Comb. 2, 233-246 (1986). Reviewer: R.Jiroušek MSC: 05C05 68R10 PDF BibTeX XML Cite \textit{Y. Kajitani} et al., Graphs Comb. 2, 233--246 (1986; Zbl 0609.05030) Full Text: DOI OpenURL
Arnborg, Stefan; Corneil, Derek G.; Proskurowski, Andrzej Complexity of finding embeddings in a k-tree. (English) Zbl 0544.68047 TRITA-NA, R. Inst. Technol., Stockh. 8407, 12 p. (1984). MSC: 68R10 68Q25 PDF BibTeX XML OpenURL