Independent point-set domination in line graphs (Q5861708): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/09728600.2021.1995307 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3212467123 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227920 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On point-set domination in graphs. VI: Quest to characterise blocks containing independent PSD-sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3158579 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent point-set dominating sets in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5572939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced cycles in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of graphs with equal domination numbers and independence numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G / rank
 
Normal rank
Property / cites work
 
Property / cites work: Point-set domination number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3220636 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:52, 28 July 2024

scientific article; zbMATH DE number 7482938
Language Label Description Also known as
English
Independent point-set domination in line graphs
scientific article; zbMATH DE number 7482938

    Statements

    Identifiers