Graphs whose vertices of degree at least 2 lie in a triangle

DOI10.1051/ro/2024198MaRDI QIDQ6667338

Jayme Luiz Szwarcfiter, Nelson F. Maculan, Min Chih Lin, Veronica A. Moyano, Abilio Lucena, Vinicius L. do Forte

Publication date: 20 January 2025

Published in: RAIRO. Operations Research (Search for Journal in Brave)

zbMATH Keywords

triangledominating induced matchingefficient edge dominationperfect edge dominationconnected cubic planar positive 1in3SATconnected planar positive 1in3SATconnected subcubic planar \(C_4\)-free positive 1in3SATneighborhood star-free graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Computational aspects of satisfiability (68R07)

This page was built for publication: Graphs whose vertices of degree at least 2 lie in a triangle