Computing the forcing spectrum of outerplanar graphs in polynomial time

The forcing number of a graph with a perfect matching M is the minimum number of edges in M whose endpoints need to be deleted, such that the remaining graph only has a single perfect matching. This number is of great interest in theoretical chemistry, since it conveys information about the structur...

Full description

Bibliographic Details

Published in:	Discrete Applied Mathematics Vol. 377; pp. 204 - 217
Main Authors:	Gorsky, Maximilian, Kreßin, Fabian
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 31.12.2025
Subjects:	Forcing number Forcing spectrum Outerplanar graphs Perfect matching Polynomial time algorithm Tight cut decomposition Outerplanar graphs Forcing number Polynomial time algorithm Forcing spectrum Perfect matching Tight cut decomposition
ISSN:	0166-218X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!