\(K_{1,3}\)-free and \(W_4\)-free graphs
From MaRDI portal
Publication:673353
DOI10.1016/S0020-0190(96)00163-9zbMath0900.68231MaRDI QIDQ673353
Publication date: 28 February 1997
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0190(96)00163-9
68R10: Graph theory (including graph drawing) in computer science
68W10: Parallel algorithms in computer science
Related Items
Maximal cliques in \(\{P_{2} \cup P_{3},C_{4}\}\)-free graphs, Semi-nice tree-decompositions: the best of branchwidth, treewidth and pathwidth with one algorithm
Cites Work