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




Related Items (37)

The bipartite margin shop and maximum red matchings free of blue-red alternating cyclesAcyclicity in edge-colored graphsPaths and trails in edge-colored graphsA note on alternating cycles in edge-coloured graphsUniquely forced perfect matching and unique 3-edge-coloringAlternating cycles and paths in edge-coloured multigraphs: A surveyStars versus stripes Ramsey numbersDecomposing edge-colored graphs under color degree constraintsA classification of edge-colored graphs based on properly colored walksA generalization of properly colored paths and cycles in edge-colored graphsAlternating kernelsEdge-disjoint properly colored cycles in edge-colored complete graphsColored constrained spanning tree on directed graphsIntersecting diametral balls induced by a geometric graphThe complexity of routing problems in forbidden-transition graphs and edge-colored graphsUnnamed ItemLong properly colored cycles in edge colored complete graphsNetworks, frictions, and price dispersionLexicographic Gröbner bases for transportation problems of format \(r\times 3\times 3\)Properly edge-colored theta graphs in edge-colored complete graphsAlternating Hamiltonian circuits in edge-coloured bipartite graphsNon-Noetherian groups and primitivity of their group algebrasA Dirac Type Condition for Properly Coloured Paths and CyclesPaths and Trails in Edge-Colored GraphsThe cone of balanced subgraphsMaximum colored trees in edge-colored graphsProperly colored short cycles in edge-colored graphsUnnamed ItemProperly Coloured Cycles and Paths: Results and Open ProblemsColor degree and alternating cycles in edge-colored graphsNote on alternating directed cyclesPaths and trails in edge-colored weighted graphsDisjoint properly colored cycles in edge-colored complete bipartite graphsMonochromatic-degree conditions for properly colored cycles in edge-colored complete graphsOn edge-colored graphs covered by properly colored cyclesSufficient 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