Pushable chromatic number of graphs with maximum average degree at most 145

DOI10.1016/J.DAM.2023.04.001MaRDI QIDQ6157430zbMATH OpenOpenAlexFDO

Authors Tapas K. Das, Sagnik Sen

Publication date 11 May 2023

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2023.04.001

zbMATH Keywords

maximum average degreeoriented graphspushable chromaticpushable homomorphism

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Pushable chromatic number of graphs with degree constraints
• Proper orientations and proper chromatic number
• On homomorphisms of oriented graphs with respect to the push operation
• Homomorphisms and oriented colorings of equivalence classes of oriented graphs
• On the pushable chromatic number of various types of grids

Cites work

• Acyclic and oriented chromatic numbers of graphs
• Complexity dichotomy for oriented homomorphism of planar graphs with large girth
• Homomorphism bounds for oriented planar graphs
• Homomorphisms and colourings of oriented graphs: an updated survey
• Homomorphisms and oriented colorings of equivalence classes of oriented graphs
• Homomorphisms from sparse graphs with large girth.
• On deeply critical oriented graphs
• On homomorphisms of oriented graphs with respect to the push operation
• On oriented cliques with respect to push operation
• On the maximum average degree and the oriented chromatic number of a graph
• On universal graphs for planar oriented graphs of a given girth
• Outerplanar and planar oriented cliques
• Pushable chromatic number of graphs with degree constraints
• The chromatic number of oriented graphs
• The monadic second order logic of graphs. VI: On several representations of graphs by relational structures

Cited in

(4)

• On the pushable chromatic number of various types of grids
• On homomorphisms of oriented graphs with respect to the push operation
• Pushable chromatic number of graphs with degree constraints
• Homomorphisms and oriented colorings of equivalence classes of oriented graphs

This page was built for publication: Pushable chromatic number of graphs with maximum average degree at most \(\frac{14}{5}\)

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