Computing small pivot-minors

DOI10.1007/978-3-030-00256-5_11MaRDI QIDQ1627161zbMATH OpenOpenAlexFDO

Authors Konrad Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-Il Oum, Daniël Paulusma

Publication date 22 November 2018

Full work available at URL http://dro.dur.ac.uk/25709/1/25709.pdf

Mathematics Subject Classification ID

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

Recommendations

• Graphs of small rank-width are pivot-minors of graphs of small tree-width
• Tree pivot-minors and linear rank-width
• Rank connectivity and pivot-minors of graphs
• Fast minor testing in planar graphs
• Branch decompositions and minor containment

Cited in

(7)

• Obstructions for bounded shrub-depth and rank-depth
• The complexity of the vertex-minor problem
• Rank connectivity and pivot-minors of graphs
• Tree pivot-minors and linear rank-width
• Vertex-minors of graphs: a survey
• Tree pivot-minors and linear rank-width
• Computing pivot-minors

This page was built for publication: Computing small pivot-minors

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