Toughness, binding number and restricted matching extension in a graph (Q2401801): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disc.2016.10.003 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2016.10.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2556378519 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-restricted matching extension in triangulations of the torus and the Klein bottle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two results on matching extensions with prescribed and proscribed edge sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On matching extensions with prescribed and proscribed edge sets. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: On restricted matching extension in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted matching in graphs of small genus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2911581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toughness in graphs -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing tough graphs is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toughness and binding number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3065457 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binding number and toughness for matching extension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tough graphs and Hamiltonian circuits. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the binding number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2715945 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the restricted matching extension of graphs in surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the restricted matching extension of graphs on the torus and the Klein bottle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toughness and matching extension in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending matchings in graphs: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393233 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent Progress in Matching Extension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4876750 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binding number conditions for matching extension / rank
 
Normal rank
Property / cites work
 
Property / cites work: The binding number of a graph and its Anderson number / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISC.2016.10.003 / rank
 
Normal rank

Latest revision as of 10:06, 18 December 2024

scientific article
Language Label Description Also known as
English
Toughness, binding number and restricted matching extension in a graph
scientific article

    Statements

    Toughness, binding number and restricted matching extension in a graph (English)
    0 references
    0 references
    0 references
    5 September 2017
    0 references
    toughness
    0 references
    binding number
    0 references
    matching extension
    0 references
    restricted matching extension
    0 references

    Identifiers