Minimal colorings for properly colored subgraphs

DOI10.1007/BF01858468zbMath0864.05035MaRDI QIDQ2563425

Zsolt Tuza, Yannis Manoussakis, Margit Voigt, Michael Spyratos

Publication date: 11 February 1997

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

spanning treeHamiltonian cyclescliqueHamiltonian paths\(k\)-edge-colored complete graphpairwise vertex-disjoint pathstotally multicolored triangle

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (12)

Improved approximation for maximum edge colouring problem ⋮ Approximation and hardness results for the maximum edge \(q\)-coloring problem ⋮ Rainbow generalizations of Ramsey theory: A survey ⋮ New bounds on the anti-Ramsey numbers of star graphs via maximum edge \(q\)-coloring ⋮ On the minimum monochromatic or multicolored subgraph partition problems ⋮ Properly edge-colored theta graphs in edge-colored complete graphs ⋮ Properly colored \(C_4\)'s in edge-colored graphs ⋮ Rainbow graph splitting ⋮ Color degree condition for long rainbow paths in edge-colored graphs ⋮ On the maximal colorings of complete graphs without some small properly colored subgraphs ⋮ Properly Coloured Cycles and Paths: Results and Open Problems ⋮ An anti-Ramsey theorem on cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Arc coverings of graphs
• On restricted colourings of \(K_ n\)
• Alternating Hamiltonian cycles
• Packing problems in edge-colored graphs
• Graphs with Hamiltonian cycles having adjacent lines different colours
• On a property of the class of n-colorable graphs
• On maximal paths and circuits of graphs
• Rainbow subgraphs in properly edge‐colored graphs
• Hamiltonian problems in edge-colored complete graphs and eulerian cycles in edge-colored graphs : some complexity results
• Some Theorems on Abstract Graphs
• On the structure of linear graphs

This page was built for publication: Minimal colorings for properly colored subgraphs