Pages that link to "Item:Q1354726"
From MaRDI portal
The following pages link to Partitioning complete bipartite graphs by monochromatic cycles (Q1354726):
Displaying 36 items.
- Vertex covers by monochromatic pieces -- a survey of results and problems (Q279224) (← links)
- Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles (Q324372) (← links)
- Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles (Q324825) (← links)
- Improved monochromatic loose cycle partitions in hypergraphs (Q396737) (← links)
- Partitioning edge-coloured complete graphs into monochromatic cycles and paths (Q402591) (← links)
- Heterochromatic tree partition problem in complete tripartite graphs (Q409432) (← links)
- Monochromatic bounded degree subgraph partitions (Q501026) (← links)
- Vertex partitions of non-complete graphs into connected monochromatic \(k\)-regular graphs (Q641170) (← links)
- Partitioning complete graphs by heterochromatic trees (Q692699) (← links)
- On the diameter of separated point sets with many nearly equal distances (Q850083) (← links)
- An improved bound for the monochromatic cycle partition number (Q859613) (← links)
- Heterochromatic tree partition numbers for complete bipartite graphs (Q932639) (← links)
- Vertex partitions of \(r\)-edge-colored graphs (Q933003) (← links)
- Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture (Q965246) (← links)
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey (Q1014813) (← links)
- Vertex partitions by connected monochromatic \(k\)-regular graphs (Q1569063) (← links)
- Vertex covering with monochromatic pieces of few colours (Q1671656) (← links)
- Bounds for graph regularity and removal lemmas (Q1930904) (← links)
- Monochromatic square-cycle and square-path partitions (Q2065889) (← links)
- Minimum degree conditions for monochromatic cycle partitioning (Q2221921) (← links)
- Heterochromatic tree partition number in complete multipartite graphs (Q2251133) (← links)
- Monochromatic cycle power partitions (Q2374161) (← links)
- On the minimum monochromatic or multicolored subgraph partition problems (Q2456352) (← links)
- Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees (Q2479574) (← links)
- Monochromatic cycle partitions of edge-colored graphs (Q3067062) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- (Q3661614) (← links)
- The complexity for partitioning graphs by monochromatic trees, cycles and paths (Q4652867) (← links)
- A note on the Size-Ramsey number of long subdivisions of graphs (Q4680735) (← links)
- An Improved Bound for Vertex Partitions by Connected Monochromatic K-Regular Graphs (Q4920655) (← links)
- Monochromatic cycle partitions in random graphs (Q4993124) (← links)
- Almost Partitioning a 3-Edge-Colored $K_{n,n}$ into Five Monochromatic Cycles (Q5270411) (← links)
- Local colourings and monochromatic partitions in complete bipartite graphs (Q5890922) (← links)
- Local colourings and monochromatic partitions in complete bipartite graphs (Q5965537) (← links)
- Ore- and Pósa-type conditions for partitioning 2-edge-coloured graphs into monochromatic cycles (Q6046228) (← links)
- Partitioning a 2-edge-coloured graph of minimum degree \(2n/3 + o(n)\) into three monochromatic cycles (Q6612514) (← links)
