Cycles and paths in edge‐colored graphs with given degrees
type: Item
instance of: scholarly article
title: Cycles and paths in edge‐colored graphs with given degrees
zbMATH Open document ID: 1202.05067
published in: Journal of Graph Theory
publication date: 2010-11-10T00:00:00Z
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C07
zbMATH DE Number: 5814468
zbMATH Keywords: edge-colored graph
zbMATH Keywords: hamiltonian graph
MaRDI profile type: Publication
full work available at URL: jgt.20440
OpenAlex ID: W4233572056
cites work: Q4358434
cites work: Fast probabilistic algorithms for Hamiltonian circuits and matchings
cites work: Q4539516
cites work: Alternating cycles and paths in edge-coloured multigraphs: A survey
cites work: Hamiltonian problems in edge-colored complete graphs and eulerian cycles in edge-colored graphs : some complexity results
cites work: Alternating Hamiltonian cycles
cites work: Some Theorems on Abstract Graphs
cites work: Characterization of edge-colored complete graphs with properly colored Hamilton paths
cites work: Q5503350
cites work: DNA physical mapping and alternating Eulerian cycles in colored graphs
cites work: Q4526776
DOI: 10.1002/JGT.20440
Recommended article: Q4659605
Recommended article: Paths and cycles in colored graphs
Recommended article: Q4901770
Recommended article: A generalization of properly colored paths and cycles in edge-colored graphs
Recommended article: Color degree and alternating cycles in edge-colored graphs
Recommended article: Color degree and heterochromatic cycles in edge-colored graphs
Recommended article: Properly colored paths and cycles in complete graphs
Recommended article: Paths, cycles and circular colorings in digraphs
Recommended article: Cycles and paths in graphs with large minimal degree
Recommended article: Cycles in color-critical graphs
description: scientific article