×

Found 19 Documents (Results 1–19)

On efficient domination for some classes of \(H\)-free chordal graphs. (English) Zbl 1383.05229

Bassino, Frédérique (ed.) et al., LAGOS 2017. Selected papers of the 9th Latin-American algorithms, graphs, and optimization symposium, Marseille, France, September 11–15, 2017. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 62, 57-62 (2017).
MSC:  05C69
PDFBibTeX XMLCite
Full Text: DOI

The maximum weight stable set problem in (\(P_6\), bull)-free graphs. (English) Zbl 1417.05223

Heggernes, Pinar (ed.), Graph-theoretic concepts in computer science. 42nd international workshop, WG 2016, Istanbul, Turkey, June 22–24, 2016. Revised selected papers. Berlin: Springer. Lect. Notes Comput. Sci. 9941, 85-96 (2016).
MSC:  05C85 05C75 68Q25
PDFBibTeX XMLCite
Full Text: DOI arXiv

Weighted efficient domination for \(P_6\)-free and for \(P_5\)-free graphs. (English) Zbl 1417.05151

Heggernes, Pinar (ed.), Graph-theoretic concepts in computer science. 42nd international workshop, WG 2016, Istanbul, Turkey, June 22–24, 2016. Revised selected papers. Berlin: Springer. Lect. Notes Comput. Sci. 9941, 38-49 (2016).
PDFBibTeX XMLCite
Full Text: DOI

Efficient domination for some subclasses of \(P_6\)-free graphs in polynomial time. (English) Zbl 1417.05150

Mayr, Ernst W. (ed.), Graph-theoretic concepts in computer science. 41st international workshop, WG 2015, Garching, Germany, June 17–19, 2015. Revised papers. Berlin: Springer. Lect. Notes Comput. Sci. 9224, 78-89 (2016).
MSC:  05C69 05C85 68Q25
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Year of Publication

Main Field