Pages that link to "Item:Q4749866"
From MaRDI portal
The following pages link to Vertex coverings by monochromatic paths and cycles (Q4749866):
Displaying 33 items.
- Vertex covers by monochromatic pieces -- a survey of results and problems (Q279224) (← links)
- Monochromatic cycle partitions of graphs with large minimum degree (Q345114) (← links)
- Partitioning edge-coloured complete graphs into monochromatic cycles and paths (Q402591) (← links)
- Heterochromatic tree partition problem in complete tripartite graphs (Q409432) (← links)
- The size Ramsey number of a directed path (Q414648) (← links)
- Partitioning 2-edge-colored graphs by monochromatic paths and cycles (Q484546) (← links)
- Coverings by few monochromatic pieces: a transition between two Ramsey problems (Q489351) (← links)
- Monochromatic cycle partitions of \(2\)-coloured graphs with minimum degree \(3n/4\) (Q668072) (← links)
- Partitioning complete graphs by heterochromatic trees (Q692699) (← 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 coverings by monochromatic cycles and trees (Q1174783) (← links)
- Vertex covering with monochromatic pieces of few colours (Q1671656) (← links)
- Monochromatic paths in random tournaments (Q1689907) (← links)
- Partitioning a graph into a cycle and a sparse graph (Q2092387) (← links)
- Minimum degree conditions for monochromatic cycle partitioning (Q2221921) (← links)
- Heterochromatic tree partition number in complete multipartite graphs (Q2251133) (← links)
- Zeons, orthozeons, and graph colorings (Q2361423) (← links)
- Cover \(k\)-uniform hypergraphs by monochromatic loose paths (Q2411510) (← links)
- Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees (Q2479574) (← links)
- Monochromatic paths in 2-edge-coloured graphs and hypergraphs (Q2699642) (← links)
- Partitioning 2-edge-colored Ore-type graphs by monochromatic cycles (Q2800590) (← links)
- Partitioning 3-coloured complete graphs into three monochromatic paths (Q2857433) (← links)
- Calculating Ramsey Numbers by Partitioning Colored Graphs (Q2978186) (← links)
- Monochromatic Cycle Partitions in Local Edge Colorings (Q3466360) (← links)
- Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles (Q3527536) (← links)
- The complexity for partitioning graphs by monochromatic trees, cycles and paths (Q4652867) (← 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)
- Partitioning a 2-edge-coloured graph of minimum degree \(2n/3 + o(n)\) into three monochromatic cycles (Q6612514) (← links)