On homomorphisms of oriented graphs with respect to the push operation

DOI10.1016/j.disc.2016.10.023zbMath1362.05089arXiv1508.07217OpenAlexW2260493414MaRDI QIDQ2397542

Sagnik Sen

Publication date: 22 May 2017

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

Full work available at URL: https://arxiv.org/abs/1508.07217

zbMATH Keywords

planar graphschromatic numbergraph homomorphismoriented graphspush operation

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (5)

Unnamed Item ⋮ On oriented cliques with respect to push operation ⋮ On the pushable chromatic number of various types of grids ⋮ Pushable chromatic number of graphs with maximum average degree at most \(\frac{14}{5}\) ⋮ Pushable chromatic number of graphs with degree constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Homomorphisms and colourings of oriented graphs: an updated survey
• Oriented vertex and arc colorings of outerplanar graphs
• Edge-switching homomorphisms of edge-coloured graphs
• On graphs that can be oriented as diagrams of ordered sets
• On reorienting graphs by pushing down maximal vertices
• On acyclic colorings of planar graphs
• On the maximum average degree and the oriented chromatic number of a graph
• Good and semi-strong colorings of oriented planar graphs
• Homomorphisms and oriented colorings of equivalence classes of oriented graphs
• Hamiltonicity and reversing arcs in digraphs
• Tournament games and positive tournaments
• The chromatic number of oriented graphs
• Homomorphism bounds for oriented planar graphs
• Acyclic colorings of planar graphs

This page was built for publication: On homomorphisms of oriented graphs with respect to the push operation