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 PDFBibTeX XMLCite \textit{M. Drmota} et al., Random Struct. Algorithms 55, No. 1, 125--152 (2019; Zbl 1423.05152) Full Text: DOI arXiv
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 PDFBibTeX XMLCite \textit{T. Calamoneri} et al., Theor. Comput. Sci. 764, 2--14 (2019; Zbl 1417.68147) Full Text: DOI Link
Baste, Julien; Noy, Marc; Sau, Ignasi On the number of labeled graphs of bounded treewidth. (English) Zbl 1486.05292 Bodlaender, Hans L. (ed.) et al., Graph-theoretic concepts in computer science. 43rd international workshop, WG 2017, Eindhoven, The Netherlands, June 21–23, 2017. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 10520, 88-99 (2017). MSC: 05C85 05C05 05C30 PDFBibTeX XMLCite \textit{J. Baste} et al., Lect. Notes Comput. Sci. 10520, 88--99 (2017; Zbl 1486.05292) Full Text: DOI arXiv
Jaffke, Lars; Bodlaender, Hans L.; Heggernes, Pinar; Telle, Jan Arne Definability equals recognizability for \(k\)-outerplanar graphs and \(l\)-chordal partial \(k\)-trees. (English) Zbl 1369.05048 Eur. J. Comb. 66, 191-234 (2017). MSC: 05C10 05C75 05C05 03C40 68Q70 PDFBibTeX XMLCite \textit{L. Jaffke} et al., Eur. J. Comb. 66, 191--234 (2017; Zbl 1369.05048) Full Text: DOI
Nagoya, Takayuki Polynomial time algorithms for variants of graph matching on partial \(k\)-trees. (English) Zbl 1378.05200 Found. Comput. Decis. Sci. 41, No. 3, 163-181 (2016). MSC: 05C85 05C70 68Q25 68R10 PDFBibTeX XMLCite \textit{T. Nagoya}, Found. Comput. Decis. Sci. 41, No. 3, 163--181 (2016; Zbl 1378.05200) Full Text: DOI
Matsushita, Masayoshi; Otachi, Yota; Araki, Toru Completely independent spanning trees in (partial) \(k\)-trees. (English) Zbl 1317.05029 Discuss. Math., Graph Theory 35, No. 3, 427-437 (2015). MSC: 05C05 05C38 PDFBibTeX XMLCite \textit{M. Matsushita} et al., Discuss. Math., Graph Theory 35, No. 3, 427--437 (2015; Zbl 1317.05029) Full Text: DOI
Sinkovic, John; van der Holst, Hein The minimum semidefinite rank of the complement of partial \(k\)-trees. (English) Zbl 1213.05173 Linear Algebra Appl. 434, No. 6, 1468-1474 (2011). MSC: 05C50 15A03 15A18 PDFBibTeX XMLCite \textit{J. Sinkovic} and \textit{H. van der Holst}, Linear Algebra Appl. 434, No. 6, 1468--1474 (2011; Zbl 1213.05173) Full Text: DOI
Esperet, Louis; Zhu, Xuding Game colouring of the square of graphs. (English) Zbl 1178.91034 Discrete Math. 309, No. 13, 4514-4521 (2009). MSC: 91A43 05C15 PDFBibTeX XMLCite \textit{L. Esperet} and \textit{X. Zhu}, Discrete Math. 309, No. 13, 4514--4521 (2009; Zbl 1178.91034) Full Text: DOI
Yang, Daqing Activation strategy for relaxed asymmetric coloring games. (English) Zbl 1167.91009 Discrete Math. 309, No. 10, 3323-3335 (2009). Reviewer: Gerald A. Heuer (Moorhead) MSC: 91A43 05C15 91A05 PDFBibTeX XMLCite \textit{D. Yang}, Discrete Math. 309, No. 10, 3323--3335 (2009; Zbl 1167.91009) Full Text: DOI
Ito, Takehiro; Kato, Akira; Zhou, Xiao; Nishizeki, Takao Algorithms for finding distance-edge-colorings of graphs. (English) Zbl 1125.05099 J. Discrete Algorithms 5, No. 2, 304-322 (2007). MSC: 05C85 05C15 05C12 68R10 68W25 PDFBibTeX XMLCite \textit{T. Ito} et al., J. Discrete Algorithms 5, No. 2, 304--322 (2007; Zbl 1125.05099) Full Text: DOI
Chlebíková, Janka; Jansen, Klaus The \(d\)-precoloring problem for \(k\)-degenerate graphs. (English) Zbl 1118.05032 Discrete Math. 307, No. 16, 2042-2052 (2007). MSC: 05C15 68R10 PDFBibTeX XMLCite \textit{J. Chlebíková} and \textit{K. Jansen}, Discrete Math. 307, No. 16, 2042--2052 (2007; Zbl 1118.05032) Full Text: DOI
Ries, B. Coloring some classes of mixed graphs. (English) Zbl 1108.05043 Discrete Appl. Math. 155, No. 1, 1-6 (2007). MSC: 05C15 68R10 PDFBibTeX XMLCite \textit{B. Ries}, Discrete Appl. Math. 155, No. 1, 1--6 (2007; Zbl 1108.05043) Full Text: DOI Link
Czumaj, Artur; Halldórsson, Magnús M.; Lingas, Andrzej; Nilsson, Johan Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth. (English) Zbl 1182.68361 Inf. Process. Lett. 94, No. 2, 49-53 (2005). MSC: 68W25 PDFBibTeX XMLCite \textit{A. Czumaj} et al., Inf. Process. Lett. 94, No. 2, 49--53 (2005; Zbl 1182.68361) Full Text: DOI
Reed, B. A. Algorithmic aspects of tree width. (English) Zbl 1035.05090 Reed, Bruce A. (ed.) et al., Recent advances in algorithms and combinatorics. New York, NY: Springer (ISBN 0-387-95434-1/hbk). CMS Books Math./Ouvrages Math. SMC 11, 85-107 (2003). Reviewer: Hans L. Bodlaender (Utrecht) MSC: 05C85 68R10 90C39 05C70 05C05 05C83 PDFBibTeX XMLCite \textit{B. A. Reed}, CMS Books Math./Ouvrages Math. SMC 11, 85--107 (2003; Zbl 1035.05090)
Andersen, Kim Allan; Pretolani, Daniele Easy cases of probabilistic satisfiability. (English) Zbl 1314.68149 Ann. Math. Artif. Intell. 33, No. 1, 69-91 (2001). MSC: 68Q25 05C65 05C85 68T27 90C35 PDFBibTeX XMLCite \textit{K. A. Andersen} and \textit{D. Pretolani}, Ann. Math. Artif. Intell. 33, No. 1, 69--91 (2001; Zbl 1314.68149) Full Text: DOI
Dessmark, A.; Lingas, A.; Proskurowski, A. Faster algorithms for subgraph isomorphism of \(k\)-connected partial \(k\)-trees. (English) Zbl 0960.05098 Algorithmica 27, No. 3-4, 337-347 (2000). Reviewer: Charles J.Colbourn (Burlington) MSC: 05C85 PDFBibTeX XMLCite \textit{A. Dessmark} et al., Algorithmica 27, No. 3--4, 337--347 (2000; Zbl 0960.05098) Full Text: DOI
Gupta, A.; Kaller, D.; Shermer, T. Linear-time algorithms for partial \(k\)-tree complements. (English) Zbl 0955.05093 Algorithmica 27, No. 3-4, 254-274 (2000). Reviewer: Hans L.Bodlaender (Utrecht) MSC: 05C85 05C05 05C70 68R10 PDFBibTeX XMLCite \textit{A. Gupta} et al., Algorithmica 27, No. 3--4, 254--274 (2000; Zbl 0955.05093) Full Text: DOI
Chaudhuri, S.; Zaroliagis, C. D. Shortest paths in digraphs of small treewidth. I: Sequential algorithms. (English) Zbl 0960.05097 Algorithmica 27, No. 3-4, 212-226 (2000). Reviewer: Charles J.Colbourn (Burlington) MSC: 05C85 68R10 PDFBibTeX XMLCite \textit{S. Chaudhuri} and \textit{C. D. Zaroliagis}, Algorithmica 27, No. 3--4, 212--226 (2000; Zbl 0960.05097) Full Text: DOI
Zhu, Xuding The game coloring number of pseudo partial \(k\)-trees. (English) Zbl 0947.05031 Discrete Math. 215, No. 1-3, 245-262 (2000). Reviewer: Arthur T.White (Kalamazoo) MSC: 05C15 05C10 05C20 05C35 05C05 PDFBibTeX XMLCite \textit{X. Zhu}, Discrete Math. 215, No. 1--3, 245--262 (2000; Zbl 0947.05031) Full Text: DOI
Isobe, Shuji; Zhou, Xiao; Nishizeki, Takao A linear algorithm for finding total colorings of partial \(k\)-trees. (English) Zbl 0955.05096 Aggarwal, Alok (ed.) et al., Algorithms and computation. 10th international symposium, ISAAC’ 99, Chennai, India, December 16-18, 1999. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1741, 347-356 (1999). Reviewer: Hans L.Bodlaender (Utrecht) MSC: 05C85 05C15 05C05 68R10 PDFBibTeX XMLCite \textit{S. Isobe} et al., Lect. Notes Comput. Sci. 1741, 347--356 (1999; Zbl 0955.05096)
Halldórsson, Magnús M.; Kortsarz, Guy Multicoloring planar graphs and partial \(k\)-trees. (English) Zbl 0945.05027 Hochbaum, Dorit (ed.) et al., Randomization, approximation, and combinatorial optimization. Algorithms and techniques. 3rd international workshop on randomization and approximation techniques in computer science, and 2nd international workshop on approximation algorithms for combinatorial optimization problems RANDOM-APPROX ’99. Berkeley, CA, USA, August 8-11, 1999. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1671, 73-84 (1999). MSC: 05C15 PDFBibTeX XMLCite \textit{M. M. Halldórsson} and \textit{G. Kortsarz}, Lect. Notes Comput. Sci. 1671, 73--84 (1999; Zbl 0945.05027)
Gupta, A.; Kaller, D.; Mahajan, S.; Shermer, T. The generalized matching problem on partial \(k\)-trees. (English) Zbl 0931.05080 Graham, Ronald L. (ed.) et al., Contemporary trends in discrete mathematics. From DIMACS and DIMATIA to the future. Proceedings of the DIMATIA-DIMACS conference, Štiřín Castle, Czech Republic, May 19–25, 1997. Providence, RI: American Mathematical Society. DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 49, 143-158 (1999). MSC: 05C85 03B15 90C39 05C70 68R10 PDFBibTeX XMLCite \textit{A. Gupta} et al., DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 49, 143--158 (1999; Zbl 0931.05080)
Isobe, Shuji; Zhou, Xiao; Nishizeki, Takao A polynomial-time algorithm for finding total colorings of partial \(k\)-trees. (English) Zbl 0915.05059 Hromkovič, Juraj (ed.) et al., Graph-theoretic concepts in computer science. 24th international workshop, WG ’98, Smolenice Castle, Slovak Republic, June 18–20, 1998. Proceecdings. Berlin: Springer. Lect. Notes Comput. Sci. 1517, 100-113 (1998). MSC: 05C15 05C05 68R10 68Q25 05C85 PDFBibTeX XMLCite \textit{S. Isobe} et al., Lect. Notes Comput. Sci. 1517, 100--113 (1998; Zbl 0915.05059)
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 PDFBibTeX XMLCite \textit{H. L. Bodlaender} and \textit{T. Hagerup}, SIAM J. Comput. 27, No. 6, 1725--1746 (1998; Zbl 0907.68089) Full Text: DOI
Jansen, Klaus; Scheffler, Petra; Woeginger, Gerhard The disjoint cliques problem. (English) Zbl 0881.90123 RAIRO, Rech. Opér. 31, No. 1, 45-66 (1997). MSC: 90C35 90B35 90C60 PDFBibTeX XMLCite \textit{K. Jansen} et al., RAIRO, Rech. Opér. 31, No. 1, 45--66 (1997; Zbl 0881.90123) Full Text: DOI EuDML
Gupta, Arvind; Kaller, Damon; Mahajan, Sanjeev; Shermer, Tom Vertex partitioning problems on partial \(k\)-trees. (English) Zbl 0886.05106 Karlsson, Rolf (ed.) et al., Algorithm theory – SWAT ’96. 5th Scandinavian workshop on algorithm theory, Reykjavík, Iceland, July 3-5, 1996. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1097, 161-172 (1996). MSC: 05C85 68R10 68Q25 05C05 05C70 03B15 PDFBibTeX XMLCite \textit{A. Gupta} et al., Lect. Notes Comput. Sci. 1097, 161--172 (1996; Zbl 0886.05106) Full Text: DOI
Bodlaender, Hans L.; Kloks, Ton A simple linear time algorithm for triangulating three-colored graphs. (English) Zbl 0785.68042 J. Algorithms 15, No. 1, 160-172 (1993). MSC: 68Q25 68R10 05C15 PDFBibTeX XMLCite \textit{H. L. Bodlaender} and \textit{T. Kloks}, J. Algorithms 15, No. 1, 160--172 (1993; Zbl 0785.68042) Full Text: DOI Link
Granot, Daniel; Skorin-Kapov, Darko NC algorithms for recognizing partial 2-trees and 3-trees. (English) Zbl 0732.05045 SIAM J. Discrete Math. 4, No. 3, 342-354 (1991). Reviewer: H.-J.Presia (Ilmenau) MSC: 05C75 68Q10 05C05 PDFBibTeX XMLCite \textit{D. Granot} and \textit{D. Skorin-Kapov}, SIAM J. Discrete Math. 4, No. 3, 342--354 (1991; Zbl 0732.05045) Full Text: DOI
Borie, Richard B. Polynomial time algorithms for recursive graph classes. (English) Zbl 0765.05085 Combinatorics, graph theory, and computing, Proc. 22nd Southeast Conf., Baton Rouge/LA (USA) 1991, Congr. Numerantium 85, 219-234 (1991). MSC: 05C85 68Q25 68R10 PDFBibTeX XMLCite \textit{R. B. Borie}, in: Proceedings of the twenty-second southeastern conference on combinatorics, graph theory, and computing, held at Louisiana State University, Baton Rouge, LA, USA, February 10-15, 1991. Winnipeg: Utilitas Mathematica Publishing Inc.. 219--234 (1991; Zbl 0765.05085)
Bodlaender, Hans L. Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees. (English) Zbl 0716.68042 J. Algorithms 11, No. 4, 631-643 (1990). Reviewer: J.Vyskoc MSC: 68Q25 68R10 90C39 PDFBibTeX XMLCite \textit{H. L. Bodlaender}, J. Algorithms 11, No. 4, 631--643 (1990; Zbl 0716.68042) Full Text: DOI
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 PDFBibTeX XMLCite \textit{A. Satyanarayana} and \textit{L. Tung}, Networks 20, No. 3, 299--322 (1990; Zbl 0701.90092) Full Text: DOI
Soumyanath, K.; Deogun, Jitender S. On the bisection width of partial k-trees. (English) Zbl 0691.68048 Combinatorics, graph theory, and computing, Proc. 20th Southeast Conf., Boca Raton/FL (USA) 1989, Congr. Numerantium 74, 25-37 (1990). MSC: 68Q25 68R10 05C05 PDFBibTeX XML
Arnborg, S.; Proskurowski, A.; Corneil, D. G. Minimal forbidden minor characterization of a class of graphs. (English) Zbl 0698.05057 Combinatorics, Proc. 7th Hung. Colloq., Eger/Hung. 1987, Colloq. Math. Soc. János Bolyai 52, 49-62 (1988). Reviewer: H.-J.Presia MSC: 05C75 05C05 PDFBibTeX XML
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 PDFBibTeX XML
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 PDFBibTeX XML
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 PDFBibTeX XML
Scheffler, Petra Linear-time algorithms for NP-complete problems restricted to partial k- trees. (English) Zbl 0629.68043 Rep., Akad. Wiss. DDR, Karl-Weierstrass-Inst. Math. R-MATH-03/87, 48 p. (1987). MSC: 68Q25 68R10 PDFBibTeX XML
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 PDFBibTeX XMLCite \textit{Y. Kajitani} et al., Graphs Comb. 2, 233--246 (1986; Zbl 0609.05030) Full Text: DOI
Arnborg, Stefan; Proskurowski, Andrzej Characterization and recognition of partial k-trees. (English) Zbl 0622.05017 Combinatorics, graph theory and computing, Proc. 16th Southeast. Conf., Boca Raton/Fla. 1985, Congr. Numerantium 47, 69-75 (1985). MSC: 05C05 68R10 PDFBibTeX XML
Arnborg, Stefan; Proskurowski, Andrzej Characterization and recognition of partial k-trees. (English) Zbl 0527.90037 TRITA-NA, R. Inst. Technol., Stockh. 8402, 24 p. (1984). MSC: 90B25 90C35 68R10 05C05 PDFBibTeX XML