Total domination in 2-connected graphs and in graphs with no induced 6-cycles (Q3605160): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.1002/jgt.20345 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4245157241 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transversal numbers of uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks on domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4515631 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small transversals in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4487071 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted domination parameters in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4508619 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted total domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new upper bound on the total domination number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3595118 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4344216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relating the size of a connected graph to its total and restricted domination numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering all cliques of a graph / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:36, 29 June 2024

scientific article
Language Label Description Also known as
English
Total domination in 2-connected graphs and in graphs with no induced 6-cycles
scientific article

    Statements

    Total domination in 2-connected graphs and in graphs with no induced 6-cycles (English)
    0 references
    0 references
    0 references
    0 references
    20 February 2009
    0 references
    0 references
    bounds
    0 references
    2-connected
    0 references
    \(C_{6}\)-free
    0 references
    total domination
    0 references
    transversals
    0 references
    0 references