scientific article; zbMATH DE number 4134069
From MaRDI portal
Publication:3035307
zbMATH Open0693.05028MaRDI QIDQ3035307FDOQ3035307
Authors: Douglas R. Woodall 
Publication date: 1990
Title of this publication is not available (Why is that?)
Recommendations
edge colourings\((m,d)^ -\)- colourings\((m,d)^*\)-colouringsimproper colouringssubcontraction of a subgraph
Cited In (22)
- Algorithms for a shared resource scheduling problem in which some level of conflict is tolerable
- On vertex partitions and some minor-monotone graph parameters
- Weighted improper colouring
- On group choosability of graphs. II
- A generalization of properly colored paths and cycles in edge-colored graphs
- Cycles of length 3 and 4 in edge-colored complete graphs with restrictions in the color transitions
- On \(\delta^{(k)}\)-colouring of powers of paths and cycles
- Minimum partition of an independence system into independent sets
- On monochromatic component size for improper colourings
- A sequential coloring algorithm for finite sets
- Spectrum graph coloring and applications to Wi-Fi channel assignment
- On the connectivity of minimum and minimal counterexamples to Hadwiger's conjecture
- An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem
- List-coloring graphs without \(K_{4,k}\)-minors
- Alternating cycles and paths in edge-coloured multigraphs: A survey
- On the structure of \(k\)-connected graphs without \(K_{k}\)-minor
- A short proof of a theorem of dirac's about hadwiger's conjecture
- Cliques, minors and apex graphs
- Bounded families for the on-line \(t\)-relaxed coloring
- On Vertex Partitions and the Colin de Verdière Parameter
- Alternating kernels
- Weighted Improper Colouring
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3035307)
