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...

Celý popis

Podrobná bibliografia

Vydané v:	Discrete Applied Mathematics Ročník 377; s. 204 - 217
Hlavní autori:	Gorsky, Maximilian, Kreßin, Fabian
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 31.12.2025
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!