Generalization of transitive fraternal augmentations for directed graphs and its applications

DOI10.1016/J.DISC.2009.02.028MaRDI QIDQ1043997zbMATH OpenOpenAlexFDO

Authors Daqing Yang

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

zbMATH Keywords

directed graphgeneralized coloring numbergreatest reduced average densitynonrepetitive coloringtransitive fraternal augmentation

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20) Applications of graph theory (05C90)

Recommendations

• Fraternal Augmentations of graphs, Coloration and Minors
• Colour number, capacity, and perfectness of directed graphs
• Colouring graphs with bounded generalized colouring number
• Colourings, homomorphisms, and partitions of transitive digraphs
• Uniform orderings for generalized coloring numbers

Cites work

• A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs, and nested interval graphs
• A simple competitive graph coloring algorithm
• Activation strategy for asymmetric marking games
• An algorithm for fraternal orientation of graphs
• Coloring with no 2-colored \(P_4\)'s
• Colouring graphs with bounded generalized colouring number
• Fraternal augmentations, arrangeability and linear 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
• Graphs with linearly bounded Ramsey numbers
• scientific article; zbMATH DE number 2209736 (Why is no real title available?)
• Nonrepetitive colorings of graphs
• Nonrepetitive colorings of graphs -- a survey
• On forbidden subdivision characterizations of graph classes
• On the degrees of the vertices of a directed graph
• Orderings on graphs and game coloring number
• Radius two trees specify χ‐bounded classes
• Star coloring bipartite planar graphs
• Structural Properties of Sparse Graphs
• The game coloring number of planar graphs
• The two-coloring number and degenerate colorings of planar graphs

Cited in

(6)

• On coloring numbers of graph powers
• Adapted game colouring of graphs
• scientific article; zbMATH DE number 5237243 (Why is no real title available?)
• A distributed low tree-depth decomposition algorithm for bounded expansion classes
• Bounding generalized coloring numbers of planar graphs using coin models
• On the mod k chromatic index of graphs

This page was built for publication: Generalization of transitive fraternal augmentations for directed graphs and its applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1043997)