An Implicit Degree Condition for Cyclability in Graphs (Q3004658): 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/978-3-642-21204-8_12 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W54346197 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles through subsets with large degree sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on a generalisation of Ore's condition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Hamilton Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles through prescribed vertices with large degree sum / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2‐neighborhoods and hamiltonian conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5750889 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implicit-degrees and circumferences / rank
 
Normal rank

Latest revision as of 03:34, 4 July 2024

scientific article
Language Label Description Also known as
English
An Implicit Degree Condition for Cyclability in Graphs
scientific article

    Statements