A note on efficient domination in a superclass of \(P_5\)-free graphs (Q2446593): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ipl.2014.02.007 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2014.02.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2025534681 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Polynomial Cases of the Weighted Efficient Domination Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hereditary Efficiently Dominatable Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent Set in <i>P</i><sub>5</sub>-Free Graphs in Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm to find an independent set of maximum weight in a fork-free graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the weighted efficient edge domination problem on bipartite permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4390693 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.IPL.2014.02.007 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:39, 18 December 2024

scientific article
Language Label Description Also known as
English
A note on efficient domination in a superclass of \(P_5\)-free graphs
scientific article

    Statements

    Identifiers