scientific article
From MaRDI portal
Publication:3035307
zbMath0693.05028MaRDI QIDQ3035307
Publication date: 1990
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
edge colourings\((m,d)^ -\)- colourings\((m,d)^*\)-colouringsimproper colouringssubcontraction of a subgraph
Related Items (19)
Alternating cycles and paths in edge-coloured multigraphs: A survey ⋮ A short proof of a theorem of dirac's about hadwiger's conjecture ⋮ On the connectivity of minimum and minimal counterexamples to Hadwiger's conjecture ⋮ Spectrum graph coloring and applications to Wi-Fi channel assignment ⋮ Weighted improper colouring ⋮ A generalization of properly colored paths and cycles in edge-colored graphs ⋮ Alternating kernels ⋮ Algorithms for a shared resource scheduling problem in which some level of conflict is tolerable ⋮ On the structure of \(k\)-connected graphs without \(K_{k}\)-minor ⋮ On group choosability of graphs. II ⋮ On monochromatic component size for improper colourings ⋮ On vertex partitions and some minor-monotone graph parameters ⋮ Minimum partition of an independence system into independent sets ⋮ List-coloring graphs without \(K_{4,k}\)-minors ⋮ Cliques, minors and apex graphs ⋮ Bounded families for the on-line \(t\)-relaxed coloring ⋮ A sequential coloring algorithm for finite sets ⋮ On Vertex Partitions and the Colin de Verdière Parameter ⋮ An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem
This page was built for publication:
