Rainbow graph splitting
type: Item
instance of: scholarly article
title: Rainbow graph splitting
zbMATH Open document ID: 1225.68137
published in: Theoretical Computer Science
publication date: 2011-10-10T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 5955889
zbMATH Keywords: complexity
zbMATH Keywords: algorithms
zbMATH Keywords: vertex partition
zbMATH Keywords: edge-coloring
author: Angelo Monti
author: Blerina Sinaimeri
MaRDI profile type: Publication
full work available at URL: j.tcs.2011.06.004
OpenAlex ID: W2053533555
cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas
cites work: Q4398864
cites work: Partitions of graphs into one or two independent sets and cliques
cites work: Q5782525
cites work: On the Complexity of Timetable and Multicommodity Flow Problems
cites work: Full Constraint Satisfaction Problems
cites work: Complexity of graph partition problems
cites work: Two algorithms for general list matrix partitions
cites work: Q4193514
cites work: An efficiently solvable graph partition problem to which many problems are reducible
cites work: A finite basis characterization of alpha-split colorings
cites work: On the adaptable chromatic number of graphs
cites work: On the minimum monochromatic or multicolored subgraph partition problems
cites work: Q4142699
cites work: Adapted List Coloring of Graphs and Hypergraphs
cites work: Minimal colorings for properly colored subgraphs
cites work: An asymptotically tight bound on the adaptable chromatic number
cites work: A simplified NP-complete satisfiability problem
cites work: Graph colourings and partitions
DOI: 10.1016/J.TCS.2011.06.004
description: scientific article; zbMATH DE number 5955889