Stable set meeting every longest path
type: Item
instance of: scholarly article
title: Stable set meeting every longest path
zbMATH Open document ID: 1056.05072
author: Frédéric Havet
published in: Discrete Mathematics
publication date: 2005-02-22T00:00:00Z
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C45
zbMATH DE Number: 2136230
zbMATH Keywords: Stable set
zbMATH Keywords: Longest path
zbMATH Keywords: Hamiltonian path
MaRDI profile type: Publication
full work available at URL: j.disc.2004.07.013
OpenAlex ID: W2015549411
cites work: A short proof of the Chen-Manalastas theorem
cites work: Q3267901
cites work: Every finite strongly connected digraph of stability 2 has a Hamiltonian path
cites work: Q5545303
cites work: Q3309863
cites work: Q4756732
cites work: Nombre chromatique et plus longs chemins d'un graphe
DOI: 10.1016/J.DISC.2004.07.013
description: scientific article; zbMATH DE number 2136230