Nash-Williams-type and Chvátal-type Conditions in One-Conflict Graphs

DOI10.1007/978-3-662-46078-8_27zbMath1435.05124OpenAlexW2099673521MaRDI QIDQ5175119

Benjamin Momège, Christian Laforest

Publication date: 20 February 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-46078-8_27

zbMATH Keywords

cycleHamiltonian pathgraph conflict

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

Domination problems with no conflicts ⋮ On the complexity of independent dominating set with obligations in graphs

This page was built for publication: Nash-Williams-type and Chvátal-type Conditions in One-Conflict Graphs