Abstract
With respect to specific cycle-related problems, edge-colored graphs can be considered as a generalization of directed graphs. We show that properly edge-colored theta graphs play a key role in characterizing the difference between edge-colored complete graphs and multipartite tournaments. We also establish sufficient conditions for an edge-colored complete graph to contain a small and a large properly edge-colored theta graph, respectively.
Highlights
All graphs considered in this paper are finite, simple, and undirected unless specified explicitly as directed graphs
In [14], it is revealed that if a colored complete graph G contains no monochromatic edge-cut and there exists a vertex v which is not contained in any PC cycles in G, a substructure of G is essentially a multipartite tournament
Our result indicates a possible approach to obtaining results on the existence of PC Hamilton cycles in colored complete graphs
Summary
All graphs considered in this paper are finite, simple, and undirected unless specified explicitly as directed graphs. Definition 1.1 A colored complete graph G is essentially a multipartite tournament if there exists a mapping f : V (G) → col(G) such that col(uv) = f (u) or col(uv) = f (v) for each edge uv ∈ E(G). In [14], it is revealed that if a colored complete graph G contains no monochromatic edge-cut and there exists a vertex v which is not contained in any PC cycles in G, a substructure of G is essentially a multipartite tournament. Observation 1.1 clearly implies the following: if a colored complete graph G is essentially a multipartite tournament, G contains no PC theta graph. Our main result characterizes the difference between CD-critical colored complete graphs and essentially multipartite tournaments in terms of the (non)existence of PC theta graphs, in the following way.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
