An implicit degree Ore-condition for pancyclicity of graphs (Q383626): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(10 intermediate revisions by 9 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10114-013-1641-2 / rank
Normal rank
 
Property / author
 
Property / author: Hao Li / rank
Normal rank
 
Property / author
 
Property / author: Jun-qing Cai / rank
Normal rank
 
Property / author
 
Property / author: Hao Li / rank
 
Normal rank
Property / author
 
Property / author: Jun-qing Cai / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C38 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C45 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6235947 / rank
 
Normal rank
Property / zbMATH Keywords
 
implicit degree
Property / zbMATH Keywords: implicit degree / rank
 
Normal rank
Property / zbMATH Keywords
 
Hamilton cycle
Property / zbMATH Keywords: Hamilton cycle / rank
 
Normal rank
Property / zbMATH Keywords
 
pancyclic
Property / zbMATH Keywords: pancyclic / rank
 
Normal rank
Property / zbMATH Keywords
 
graph
Property / zbMATH Keywords: graph / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10114-013-1641-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2008184403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Geng-Hua Fan conditions for pancyclic or Hamilton-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pancyclic graphs. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An implicit degree condition for long cycles in 2-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Hamilton Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pancyclic graphs and a conjecture of Bondy and Chvatal / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cycle structure theorem for Hamiltonian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implicit-degrees and circumferences / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10114-013-1641-2 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:58, 9 December 2024

scientific article
Language Label Description Also known as
English
An implicit degree Ore-condition for pancyclicity of graphs
scientific article

    Statements

    An implicit degree Ore-condition for pancyclicity of graphs (English)
    0 references
    0 references
    0 references
    5 December 2013
    0 references
    implicit degree
    0 references
    Hamilton cycle
    0 references
    pancyclic
    0 references
    graph
    0 references

    Identifiers