scientific article; zbMATH DE number 1067836
From MaRDI portal
Publication:4358434
DOI<179::AID-RSA5>3.0.CO;2-P 10.1002/(SICI)1098-2418(199709)11:2<179::AID-RSA5>3.0.CO;2-PzbMath0882.05084MaRDI QIDQ4358434
Publication date: 2 March 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)
Related Items (36)
Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic paths of length three ⋮ Some algorithmic results for finding compatible spanning circuits in edge-colored graphs ⋮ Properly coloured copies and rainbow copies of large graphs with small maximum degree ⋮ Alternating cycles and paths in edge-coloured multigraphs: A survey ⋮ Proper vertex-pancyclicity of edge-colored complete graphs without joint monochromatic triangles ⋮ Maximum properly colored trees in edge-colored graphs ⋮ Bounded colorings of multipartite graphs and hypergraphs ⋮ Properly coloured Hamiltonian paths in edge-coloured complete graphs ⋮ Properly coloured Hamiltonian cycles in edge-coloured complete graphs ⋮ Compatible spanning circuits in edge-colored graphs ⋮ Properly colored 2-factors of edge-colored complete bipartite graphs ⋮ Graph Tilings in Incompatibility Systems ⋮ Edge-disjoint properly colored cycles in edge-colored complete graphs ⋮ Properly colored Hamilton cycles in Dirac-type hypergraphs ⋮ Long properly colored cycles in edge colored complete graphs ⋮ Properly colored and rainbow copies of graphs with few cherries ⋮ Fork-forests in bi-colored complete bipartite graphs ⋮ Almost Eulerian compatible spanning circuits in edge-colored graphs ⋮ Properly edge-colored theta graphs in edge-colored complete graphs ⋮ On the number of alternating paths in random graphs ⋮ Symbolic coloured SCC decomposition ⋮ Compatible Hamilton cycles in Dirac graphs ⋮ A Dirac Type Condition for Properly Coloured Paths and Cycles ⋮ Cycles of given length in oriented graphs ⋮ Hamiltonian degree sequences in digraphs ⋮ On the number of alternating paths in bipartite complete graphs ⋮ Cycles and paths in edge‐colored graphs with given degrees ⋮ Unnamed Item ⋮ Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey ⋮ Color neighborhood union conditions for proper edge-pancyclicity of edge-colored complete graphs ⋮ Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic triangles ⋮ Compatible Hamilton cycles in random graphs ⋮ Properly Coloured Cycles and Paths: Results and Open Problems ⋮ Color degree and alternating cycles in edge-colored graphs ⋮ Monochromatic-degree conditions for properly colored cycles in edge-colored complete graphs ⋮ Extensions of results on rainbow Hamilton cycles in uniform hypergraphs
This page was built for publication:
