Some variations of perfect graphs

DOI10.7151/DMGT.1880zbMATH Open1339.05154OpenAlexW2334519803MaRDI QIDQ726645FDOQ726645

Authors: Magda Dettlaff, Magdalena Lemańska, Gabriel Semanišin, Rita Zuazua 

Publication date: 13 July 2016

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1880

Recommendations

• On \(\alpha_{r}\gamma_{s}(k)\)-perfect graphs
• A characterization of \(\Gamma\alpha(k)\)-perfect graphs
• Distance perfectness of graphs
• scientific article; zbMATH DE number 5844229
• Perfect \(k\)-domination in graphs

zbMATH Keywords

\(k\)-path vertex coverperfect graphsdistance \(k\)-domination number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph representations (geometric and intersection representations, etc.) (05C62) Perfect graphs (05C17)

Cites Work

• Title not available (Why is that?)
• Graph Classes: A Survey
• Minimum \(k\)-path vertex cover
• Perfect connected-dominant graphs
• Title not available (Why is that?)
• On graphs with equal domination and covering numbers
• On weakly connected domination in graphs. II.
• Title not available (Why is that?)

Cited In (6)

• Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number
• On \(\alpha_{r}\gamma_{s}(k)\)-perfect graphs
• The weighted \(k\)-path vertex cover problem on series-parallel graphs
• Graphs with equal domination and covering numbers
• A note onKi-perfect graphs
• Bipartite graphs with close domination and \(k\)-domination numbers

This page was built for publication: Some variations of perfect graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q726645)