Uniquely monopolar-partitionable block graphs

MaRDI QIDQ5167717zbMATH OpenFDO

Authors Xuegang Chen, Jing Huang

Publication date 1 July 2014

Full work available at URL https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/2543/0.html

zbMATH Keywords

block graphcharacterizationmonopolar graphmonopolar partitionpolynomial time algorithmuniquely monopolar-partitionable graph

Mathematics Subject Classification ID

Graph designs and isomorphic decomposition (05C51) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Complexity and algorithms for recognizing polar and monopolar graphs
• Recognition of unipolar and generalised split graphs
• Solving partition problems with colour-bipartitions
• Recognizing polar planar graphs using new results for monopolarity
• On the Polarity and Monopolarity of Graphs

Cited in

(2)

• Recognition of unipolar and generalised split graphs
• Monopolar graphs: complexity of computing classical graph parameters

This page was built for publication: Uniquely monopolar-partitionable block graphs

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