Partition of graphs with maximum degree ratio

DOI10.1007/S10479-025-06615-7MaRDI QIDQ6945271zbMATH OpenFDO

Authors Valentin Bouquet, François Delbot, Christophe Picouleau

Publication date 9 August 2025

Published in Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

bipartite graphNP-completenessregular graphedge-cutvertex-partitiondegree ratio

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Structural characterization of families of graphs (05C75) Fractional graph theory, fuzzy graph theory (05C72)

This page was built for publication: Partition of graphs with maximum degree ratio

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