An algorithm for finding a large independent set in planar graphs

DOI10.1002/NET.3230130209MaRDI QIDQ4745274zbMATH OpenOpenAlexFDO

Authors Norishige Chiba, Nobuji Saito, Takao Nishizeki

Publication date 1983

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230130209

Mathematics Subject Classification ID

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

Cites work

• Efficient Planarity Testing

Cited in

(4)

• The maximum clique problem
• Graph theory (algorithmic, algebraic, and metric problems)
• On the d-independence number in 1-planar graphs
• On the independence number of 1-planar graphs

This page was built for publication: An algorithm for finding a large independent set in planar graphs

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