Properly edge-colored theta graphs in edge-colored complete graphs
From MaRDI portal
Publication:1733876
DOI10.1007/s00373-018-1989-2zbMath1407.05097OpenAlexW2902785995WikidataQ128858630 ScholiaQ128858630MaRDI QIDQ1733876
Ruonan Li, Hajo J. Broersma, Sheng Gui Zhang
Publication date: 21 March 2019
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-018-1989-2
complete graphmultipartite tournamentedge-colored graphproperly edge-colored cycleproperly edge-colored theta graph
Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)
Related Items (10)
Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic paths of length three ⋮ A classification of edge-colored graphs based on properly colored walks ⋮ The complexity of routing problems in forbidden-transition graphs and edge-colored graphs ⋮ Non-chromatic-adherence of the DP color function via generalized theta graphs ⋮ Unnamed Item ⋮ Properly colored \(C_4\)'s in edge-colored graphs ⋮ On list equitable total colorings of the generalized theta graph ⋮ On the maximal colorings of complete graphs without some small properly colored subgraphs ⋮ On supereulerian 2-edge-coloured graphs ⋮ Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic triangles
Cites Work
- Unnamed Item
- Unnamed Item
- Color degree sum conditions for rainbow triangles in edge-colored graphs
- Rainbow \(C_3\)'s and \(C_4\)'s in edge-colored graphs
- Properly colored paths and cycles
- Alternating cycles in edge-partitioned graphs
- Graphs with cycles having adjacent lines different colors
- Alternating Hamiltonian cycles
- A property of the colored complete graph
- A note on alternating cycles in edge-coloured graphs
- Properly coloured Hamiltonian cycles in edge-coloured complete graphs
- Graphs with Hamiltonian cycles having adjacent lines different colours
- Cycle extension in edge-colored complete graphs
- Rainbow triangles in edge-colored graphs
- Multipartite tournaments: a survey
- Minimal colorings for properly colored subgraphs
- Edge colorings of complete graphs without tricolored triangles
- Color degree and monochromatic degree conditions for short properly colored cycles in edge‐colored graphs
- An Edge-Colored Version of Dirac's Theorem
- A Dirac Type Condition for Properly Coloured Paths and Cycles
- Transitiv orientierbare Graphen
This page was built for publication: Properly edge-colored theta graphs in edge-colored complete graphs
