Pages that link to "Item:Q2563425"

The following pages link to Minimal colorings for properly colored subgraphs (Q2563425):

Displaying 12 items.

• Approximation and hardness results for the maximum edge \(q\)-coloring problem (Q350721) (← links)
• Rainbow generalizations of Ramsey theory: A survey (Q604649) (← links)
• Rainbow graph splitting (Q719272) (← links)
• Properly edge-colored theta graphs in edge-colored complete graphs (Q1733876) (← links)
• Properly colored \(C_4\)'s in edge-colored graphs (Q2005704) (← links)
• On the maximal colorings of complete graphs without some small properly colored subgraphs (Q2053693) (← links)
• Improved approximation for maximum edge colouring problem (Q2161229) (← links)
• On the minimum monochromatic or multicolored subgraph partition problems (Q2456352) (← links)
• An anti-Ramsey theorem on cycles (Q2573806) (← links)
• Properly Coloured Cycles and Paths: Results and Open Problems (Q3655153) (← links)
• Color degree condition for long rainbow paths in edge-colored graphs (Q5964923) (← links)
• New bounds on the anti-Ramsey numbers of star graphs via maximum edge \(q\)-coloring (Q6197752) (← links)