Asymmetric coloring games on incomparability graphs (Q324375): Difference between revisions

Latest revision as of 18:27, 12 July 2024

scientific article; zbMATH DE number 6312251

Coloring Relatives of Interval Overlap Graphs via On-line Games

Language	Label	Description	Also known as
English	Asymmetric coloring games on incomparability graphs	scientific article; zbMATH DE number 6312251	Coloring Relatives of Interval Overlap Graphs via On-line Games

Statements

instance of

scholarly article

0 references

title

Asymmetric coloring games on incomparability graphs (English)

0 references

Coloring Relatives of Interval Overlap Graphs via On-line Games (English)

0 references

0 references

0 references

14 October 2016

0 references

1 July 2014

0 references

full work available at URL

https://arxiv.org/abs/1503.04748

0 references

zbMATH Keywords

game chromatic number

0 references

Grundy number

0 references

incomparability graphs

0 references

intersection graph

0 references

line segments

0 references

triangle-free

0 references

chromatic number

0 references

MaRDI profile type

MaRDI publication profile

0 references

published in

Automata, Languages, and Programming

0 references

cites work

ON THE COMPLEXITY OF SOME COLORING GAMES

0 references

First-Fit Coloring of Incomparability Graphs

0 references

A bound for the game chromatic number of graphs

0 references

Q4201568

0 references

Game chromatic number of outerplanar graphs

0 references

The game Grundy number of graphs

0 references

An Effective Version of Dilworth's Theorem

0 references

A simple competitive graph coloring algorithm

0 references

Asymmetric graph coloring games

0 references

Radius two trees specify χ‐bounded classes

0 references

Very asymmetric marking games

0 references

Lower bounds for the game colouring number of partial \(k\)-trees and planar graphs

0 references

Activation strategy for asymmetric marking games

0 references

The game coloring number of planar graphs

0 references

The game coloring number of pseudo partial \(k\)-trees

0 references

Refined activation strategy for the marking game

0 references

Identifiers

zbMATH Open document ID

1346.05188

0 references

1412.05069

0 references

DOI

10.1016/j.endm.2015.06.108

0 references

10.1007/978-3-662-43948-7_61

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:324375

@@ Property / cites work @@
+ON THE COMPLEXITY OF SOME COLORING GAMES
@@ Property / cites work: ON THE COMPLEXITY OF SOME COLORING GAMES / rank @@
+Normal rank
@@ Property / cites work @@
+First-Fit Coloring of Incomparability Graphs
@@ Property / cites work: First-Fit Coloring of Incomparability Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A bound for the game chromatic number of graphs
@@ Property / cites work: A bound for the game chromatic number of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4201568
@@ Property / cites work: Q4201568 / rank @@
+Normal rank
@@ Property / cites work @@
+Game chromatic number of outerplanar graphs
@@ Property / cites work: Game chromatic number of outerplanar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The game Grundy number of graphs
@@ Property / cites work: The game Grundy number of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+An Effective Version of Dilworth's Theorem
@@ Property / cites work: An Effective Version of Dilworth's Theorem / rank @@
+Normal rank
@@ Property / cites work @@
+A simple competitive graph coloring algorithm
@@ Property / cites work: A simple competitive graph coloring algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Asymmetric graph coloring games
@@ Property / cites work: Asymmetric graph coloring games / rank @@
+Normal rank
@@ Property / cites work @@
+Radius two trees specify χ‐bounded classes
@@ Property / cites work: Radius two trees specify χ‐bounded classes / rank @@
+Normal rank
@@ Property / cites work @@
+Very asymmetric marking games
@@ Property / cites work: Very asymmetric marking games / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds for the game colouring number of partial \(k\)-trees and planar graphs
+Normal rank
@@ Property / cites work @@
+Activation strategy for asymmetric marking games
@@ Property / cites work: Activation strategy for asymmetric marking games / rank @@
+Normal rank
@@ Property / cites work @@
+The game coloring number of planar graphs
@@ Property / cites work: The game coloring number of planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The game coloring number of pseudo partial \(k\)-trees
+Normal rank
@@ Property / cites work @@
+Refined activation strategy for the marking game
@@ Property / cites work: Refined activation strategy for the marking game / rank @@
+Normal rank