Faster algorithms for graph monopolarity

DOI10.1007/978-3-032-11835-6_30MaRDI QIDQ7294448zbMATH OpenFDO

Authors Geevarghese Philip, Shrinidhi Teganahally Sridhara

Publication date 10 July 2026

Full work available at URL https://doi.org/10.1007/978-3-032-11835-6_30

Mathematics Subject Classification ID

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

Cites work

• A faster algorithm for vertex cover parameterized by solution size
• Complexity and algorithms for recognizing polar and monopolar graphs
• Fixed-parameter tractability results for feedback set problems in tournaments
• Graph theory
• Line-Polar Graphs: Characterization and Recognition
• List monopolar partitions of claw-free graphs
• On the Polarity and Monopolarity of Graphs
• Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs
• Polar cographs
• Polarity of chordal graphs
• Recognizing polar planar graphs using new results for monopolarity
• Solving partition problems almost always requires pushing many vertices around
• Solving partition problems with colour-bipartitions

This page was built for publication: Faster algorithms for graph monopolarity

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