Proper Hamiltonian paths in edge-coloured multigraphs (Q2409503): Difference between revisions

From MaRDI portal
Merged Item from Q2857311
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by the same user not shown)
Property / cites work
 
Property / cites work: Cycles and paths in edge‐colored graphs with given degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating cycles and paths in edge-coloured multigraphs: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4500916 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian problems in edge-colored complete graphs and eulerian cycles in edge-colored graphs : some complexity results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of edge-colored complete graphs with properly colored Hamilton paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properly Coloured Cycles and Paths: Results and Open Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph folding and programmable logic array / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526776 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5545296 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge bounds in nonhamiltonian \(k\)-connected graphs / rank
 
Normal rank

Latest revision as of 13:43, 14 July 2024

scientific article; zbMATH DE number 6221976
  • Proper Hamiltonian Paths in Edge-Coloured Multigraphs
Language Label Description Also known as
English
Proper Hamiltonian paths in edge-coloured multigraphs
scientific article; zbMATH DE number 6221976
  • Proper Hamiltonian Paths in Edge-Coloured Multigraphs

Statements

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references