Perfect matchings in total domination critical graphs (Q659733): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00373-010-1000-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2064587262 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On diameter critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On diameter 2-critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum number of edges in a minimal graph of diameter 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The diameter of total domination vertex critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4443245 / 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: Q5460882 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5461547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a conjecture of Murty and Simon on diameter 2-critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of \(k\)-partite or \(K_p\)-free total domination edge-critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of selected recent results on total domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On total domination vertex critical graphs of high connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of total domination edge-critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraphs with large transversal number and with edge sizes at least 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total domination in 2-connected graphs and in graphs with no induced 6-cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3410859 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Critical Graphs of Diameter 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total domination of graphs and small transversals of hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5781249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Short Proof of the Factor Theorem for Finite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hereditary Domination in Graphs: Characterization with Forbidden Induced Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228229 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4933935 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total Domination Edge Critical Graphs with Maximum Diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5466050 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constructive characterization of total domination vertex critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching properties in total domination vertex critical graphs / rank
 
Normal rank

Latest revision as of 21:23, 4 July 2024

scientific article
Language Label Description Also known as
English
Perfect matchings in total domination critical graphs
scientific article

    Statements

    Perfect matchings in total domination critical graphs (English)
    0 references
    0 references
    0 references
    24 January 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    total domination number
    0 references
    edge-critical graph
    0 references
    vertex-critical graph
    0 references
    perfect matching
    0 references
    factor-critical graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references