Generalization of transitive fraternal augmentations for directed graphs and its applications
From MaRDI portal
Publication:1043997
DOI10.1016/j.disc.2009.02.028zbMath1210.05057OpenAlexW2045111615MaRDI QIDQ1043997
Publication date: 10 December 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2009.02.028
directed graphnonrepetitive coloringgreatest reduced average densitygeneralized coloring numbertransitive fraternal augmentation
Applications of graph theory (05C90) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)
Related Items (4)
On coloring numbers of graph powers ⋮ Adapted game colouring of graphs ⋮ Bounding generalized coloring numbers of planar graphs using coin models ⋮ A distributed low tree-depth decomposition algorithm for bounded expansion classes
Cites Work
- Unnamed Item
- Activation strategy for asymmetric marking games
- On forbidden subdivision characterizations of graph classes
- Nonrepetitive colorings of graphs -- a survey
- Fraternal augmentations, arrangeability and linear Ramsey numbers
- Colouring graphs with bounded generalized colouring number
- An algorithm for fraternal orientation of graphs
- The game coloring number of planar graphs
- A simple competitive graph coloring algorithm
- Orderings on graphs and game coloring number
- Coloring with no 2-colored \(P_4\)'s
- Graphs with linearly bounded Ramsey numbers
- Grad and classes with bounded expansion. I: Decompositions
- Grad and classes with bounded expansion. II: Algorithmic aspects
- Grad and classes with bounded expansion. III: Restricted graph homomorphism dualities
- On the degrees of the vertices of a directed graph
- The Two-Coloring Number and Degenerate Colorings of Planar Graphs
- Structural Properties of Sparse Graphs
- Star coloring bipartite planar graphs
- A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs, and nested interval graphs
- Radius two trees specify χ‐bounded classes
- Nonrepetitive colorings of graphs
This page was built for publication: Generalization of transitive fraternal augmentations for directed graphs and its applications
