Some Hamiltonian Properties of One-Conflict Graphs (Q2946062): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A method in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-factors in orientated graphs with forbidden transitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Algorithm to Check the Existence of (Elementary) Paths and a Generalisation of the Cut Problem in Graphs with Forbidden Transitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trees in Graphs with Conflict Edges or Forbidden Transitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Hamilton Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding paths in graphs avoiding forbidden transitions / rank
 
Normal rank

Latest revision as of 19:15, 10 July 2024

scientific article
Language Label Description Also known as
English
Some Hamiltonian Properties of One-Conflict Graphs
scientific article

    Statements