On a graph theoretic division algorithm and maximal decompositions of graphs

MaRDI QIDQ2791965zbMATH OpenFDO

Authors Eric Andrews, Ping Zhang

Publication date 16 March 2016

Published in JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

zbMATH Keywords

intermediate decomposition propertymaximal decompositionsremainder subgraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75)

Recommendations

• A graph theoretic division algorithm
• On maximal decompositions of graphs
• scientific article; zbMATH DE number 4012650
• List decomposition of graphs.
• On the completeness of decomposable properties of graphs

Cited in

(3)

• The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes
• A graph theoretic division algorithm
• On maximal decompositions of graphs

This page was built for publication: On a graph theoretic division algorithm and maximal decompositions of graphs

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