Alternating cycles in edge-partitioned graphs
From MaRDI portal
Publication:1167184
DOI10.1016/0095-8956(83)90008-4zbMath0491.05039OpenAlexW2016579766MaRDI QIDQ1167184
Jerrold W. Grossman, Roland Haeggkvist
Publication date: 1983
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(83)90008-4
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)
Related Items (37)
The bipartite margin shop and maximum red matchings free of blue-red alternating cycles ⋮ Acyclicity in edge-colored graphs ⋮ Paths and trails in edge-colored graphs ⋮ A note on alternating cycles in edge-coloured graphs ⋮ Uniquely forced perfect matching and unique 3-edge-coloring ⋮ Alternating cycles and paths in edge-coloured multigraphs: A survey ⋮ Stars versus stripes Ramsey numbers ⋮ Decomposing edge-colored graphs under color degree constraints ⋮ A classification of edge-colored graphs based on properly colored walks ⋮ A generalization of properly colored paths and cycles in edge-colored graphs ⋮ Alternating kernels ⋮ Edge-disjoint properly colored cycles in edge-colored complete graphs ⋮ Colored constrained spanning tree on directed graphs ⋮ Intersecting diametral balls induced by a geometric graph ⋮ The complexity of routing problems in forbidden-transition graphs and edge-colored graphs ⋮ Unnamed Item ⋮ Long properly colored cycles in edge colored complete graphs ⋮ Networks, frictions, and price dispersion ⋮ Lexicographic Gröbner bases for transportation problems of format \(r\times 3\times 3\) ⋮ Properly edge-colored theta graphs in edge-colored complete graphs ⋮ Alternating Hamiltonian circuits in edge-coloured bipartite graphs ⋮ Non-Noetherian groups and primitivity of their group algebras ⋮ A Dirac Type Condition for Properly Coloured Paths and Cycles ⋮ Paths and Trails in Edge-Colored Graphs ⋮ The cone of balanced subgraphs ⋮ Maximum colored trees in edge-colored graphs ⋮ Properly colored short cycles in edge-colored graphs ⋮ Unnamed Item ⋮ Properly Coloured Cycles and Paths: Results and Open Problems ⋮ Color degree and alternating cycles in edge-colored graphs ⋮ Note on alternating directed cycles ⋮ Paths and trails in edge-colored weighted graphs ⋮ Disjoint properly colored cycles in edge-colored complete bipartite graphs ⋮ Monochromatic-degree conditions for properly colored cycles in edge-colored complete graphs ⋮ On edge-colored graphs covered by properly colored cycles ⋮ Sufficient conditions for properly colored \(C_3\)'s and \(C_4\)'s in edge-colored complete graphs ⋮ \(H\)-cycles in \(H\)-colored multigraphs
Cites Work
This page was built for publication: Alternating cycles in edge-partitioned graphs