K₁,3-free and W₄-free graphs

DOI10.1016/S0020-0190(96)00163-9zbMATH Open0900.68231OpenAlexW134812493MaRDI QIDQ673353FDOQ673353

Authors: Ton Kloks 

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

zbMATH Keywords

algorithmsperfect graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Cites Work

• Title not available (Why is that?)
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Title not available (Why is that?)
• Computing the Minimum Fill-In is NP-Complete
• Title not available (Why is that?)

Cited In (2)

• 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

This page was built for publication: \(K_{1,3}\)-free and \(W_4\)-free graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q673353)