Supereulerian graphs with small matching number and 2-connected hamiltonian claw-free graphs (Q2935385): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Zheng-Ke Miao / rank
Normal rank
 
Property / author
 
Property / author: Ke-ke Wang / rank
Normal rank
 
Property / author
 
Property / author: Zheng-Ke Miao / rank
 
Normal rank
Property / author
 
Property / author: Ke-ke Wang / 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.1080/00207160.2013.858808 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2040576723 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The spanning subgraphs of eulerian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on minimum degree conditions for supereulerian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reduction method to find spanning Eulerian subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Supereulerian graphs: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs without spanning closed trails / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on Hamiltonian circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Eulerian and Hamiltonian Graphs and Line Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Supereulerian graphs in the graph family \(C_{2}(6,k)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Supereulerian graphs and matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The supereulerian graphs in the graph family \(C(l,k)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on graphs spanned by Eulerian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a closure concept in claw-free graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:13, 9 July 2024

scientific article
Language Label Description Also known as
English
Supereulerian graphs with small matching number and 2-connected hamiltonian claw-free graphs
scientific article

    Statements

    Supereulerian graphs with small matching number and 2-connected hamiltonian claw-free graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    29 December 2014
    0 references
    supereulerian graphs
    0 references
    collapsible graphs
    0 references
    reductions
    0 references
    contraction characterizations
    0 references

    Identifiers