Pages that link to "Item:Q1306426"

The following pages link to Two-coloring the edges of a cubic graph such that each monochromatic component is a path of length at most 5 (Q1306426):

Displayed 12 items.

• Relaxed two-coloring of cubic graphs (Q885301) ‎ (← links)
• The linear 3-arboricity of \(K_{n,n}\) and \(K_n\) (Q932632) ‎ (← links)
• Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey (Q1014813) ‎ (← links)
• Planar graphs without 5-cycles or without 6-cycles (Q1025913) ‎ (← links)
• Bounded size components -- partitions and transversals. (Q1400964) ‎ (← links)
• Partitioning into graphs with only small components (Q1405114) ‎ (← links)
• On monochromatic component size for improper colourings (Q1775062) ‎ (← links)
• Graph coloring with no large monochromatic components (Q3503460) ‎ (← links)
• Deciding Relaxed Two-Colourability: A Hardness Jump (Q3557504) ‎ (← links)
• Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph (Q5302064) ‎ (← links)
• On isomorphic linear partitions in cubic graphs (Q5899382) ‎ (← links)
• On isomorphic linear partitions in cubic graphs (Q5902338) ‎ (← links)