On the hardness of the Balanced Connected Subgraph Problem for families of Regular Graphs

DOI10.20429/TAG.2023.10202MaRDI QIDQ6068941

Unnamed Author

Publication date: 15 December 2023

Published in: Theory and Applications of Graphs (Search for Journal in Brave)

zbMATH Keywords

maximum cardinality induced connected subgraphtime complexity of the BCS problem

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

This page was built for publication: On the hardness of the Balanced Connected Subgraph Problem for families of Regular Graphs