The following pages link to (Q3035307):
Displaying 22 items.
- On the connectivity of minimum and minimal counterexamples to Hadwiger's conjecture (Q858685) (← links)
- Minimum partition of an independence system into independent sets (Q1013303) (← links)
- List-coloring graphs without \(K_{4,k}\)-minors (Q1028458) (← links)
- Cliques, minors and apex graphs (Q1043579) (← links)
- Bounded families for the on-line \(t\)-relaxed coloring (Q1044722) (← links)
- A sequential coloring algorithm for finite sets (Q1297462) (← links)
- Alternating cycles and paths in edge-coloured multigraphs: A survey (Q1356728) (← links)
- Spectrum graph coloring and applications to Wi-Fi channel assignment (Q1657008) (← links)
- Alternating kernels (Q1693142) (← links)
- Fixing improper colorings of graphs (Q1698729) (← links)
- On the structure of \(k\)-connected graphs without \(K_{k}\)-minor (Q1767621) (← links)
- On monochromatic component size for improper colourings (Q1775062) (← links)
- Weighted improper colouring (Q1932354) (← links)
- On group choosability of graphs. II (Q2014707) (← links)
- Algorithms for a shared resource scheduling problem in which some level of conflict is tolerable (Q2434306) (← links)
- A generalization of properly colored paths and cycles in edge-colored graphs (Q2682924) (← links)
- On vertex partitions and some minor-monotone graph parameters (Q3067061) (← links)
- Weighted Improper Colouring (Q3111636) (← links)
- On Vertex Partitions and the Colin de Verdière Parameter (Q3439630) (← links)
- A short proof of a theorem of dirac's about hadwiger's conjecture (Q3990876) (← links)
- An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem (Q5136236) (← links)
- Cycles of length 3 and 4 in edge-colored complete graphs with restrictions in the color transitions (Q6602386) (← links)
