On the complexity of rainbow coloring problems (Q1647834): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by one other user not shown)
aliases / en / 0aliases / en / 0
 
On the Complexity of Rainbow Coloring Problems
description / endescription / en
scientific article
scientific article; zbMATH DE number 6562486
Property / title
 
On the Complexity of Rainbow Coloring Problems (English)
Property / title: On the Complexity of Rainbow Coloring Problems (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1474.68221 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-319-29516-9_18 / rank
 
Normal rank
Property / published in
 
Property / published in: Lecture Notes in Computer Science / rank
 
Normal rank
Property / publication date
 
4 April 2016
Timestamp+2016-04-04T00:00:00Z
Timezone+00:00
Calendar⧼valueview-expert-timevalue-calendar-gregorian⧽
Precision1 day
Before0
After0
Property / publication date: 4 April 2016 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68R10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6562486 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2291220303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Hardness Results in Rainbow Connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Linear Time Minor Tests with Depth-First Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness and algorithms for rainbow connection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow Colouring of Split and Threshold Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inapproximability of Rainbow Colouring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connection in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow trees in graphs and generalized connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further hardness results on the rainbow vertex-connection number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of determining the rainbow vertex-connection of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time solvable optimization problems on graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3577833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of rainbow coloring problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the corona of two graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logical approach to multicut problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4560246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The rainbow connection of a graph is (at most) reciprocal to its minimum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further hardness results on rainbow and strong rainbow connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong rainbow vertex-connection of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connections of graphs: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connection number and connected dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the rainbow connectivity of graphs: complexity and FPT algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002782 / rank
 
Normal rank

Latest revision as of 01:30, 16 July 2024

scientific article; zbMATH DE number 6562486
  • On the Complexity of Rainbow Coloring Problems
Language Label Description Also known as
English
On the complexity of rainbow coloring problems
scientific article; zbMATH DE number 6562486
  • On the Complexity of Rainbow Coloring Problems

Statements

On the complexity of rainbow coloring problems (English)
0 references
On the Complexity of Rainbow Coloring Problems (English)
0 references
0 references
0 references
0 references
0 references
0 references
27 June 2018
0 references
4 April 2016
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
rainbow coloring
0 references
rainbow connection number
0 references
graph algorithms
0 references
treewidth
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references