On the complexity of the flow coloring problem
type: Item
instance of: scholarly article
title: On the complexity of the flow coloring problem
zbMATH Open document ID: 1321.05075
author: Cristiana Huiban
author: Carlos Diego Rodrigues
author: Manoel Campêlo
author: Rudini M. Sampaio
published in: Discrete Applied Mathematics
publication date: 2015-09-30T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C21
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6487401
zbMATH Keywords: round weighting problem
zbMATH Keywords: flow coloring
zbMATH Keywords: bipartite graphs
zbMATH Keywords: NP-hardness
zbMATH Keywords: inapproximability
MaRDI profile type: Publication
full work available at URL: j.dam.2015.06.025
OpenAlex ID: W759230654
cites work: Q5315023
cites work: Strong edge-colouring and induced matchings
cites work: Algorithms for finding distance-edge-colorings of graphs
cites work: Q5417627
cites work: On the complexity of bandwidth allocation in radio networks
cites work: On the computational complexity of strong edge coloring
cites work: A note on the strong chromatic index of bipartite graphs
cites work: The strong equitable vertex 2-arboricity of complete bipartite and tripartite graphs
cites work: Max flows in O(nm) time, or better
cites work: Q4527015
cites work: A polynomial time algorithm for strong edge coloring of partial \(k\)-trees
cites work: Solving the 2-disjoint paths problem in nearly linear time
DOI: 10.1016/J.DAM.2015.06.025
Recommended article: The complexity of colouring problems on dense graphs
Recommended article: The complexity of some graph colouring problems
Recommended article: Q3690214
Recommended article: On the complexity of rainbow coloring problems
Recommended article: On the Complexity of Ordered Colorings
Recommended article: On the complexity of H-coloring
Recommended article: Q3758852
Recommended article: The complexity of the partition coloring problem
Recommended article: On the complexity of \(k\)-rainbow cycle colouring problems
description: scientific article; zbMATH DE number 6487401