On oriented cliques with respect to push operation

DOI10.1016/j.dam.2017.07.037zbMath1372.05050arXiv1511.08672OpenAlexW2963318263MaRDI QIDQ2410221

Julien Bensmail, Soumen Nandi, Sagnik Sen

Publication date: 17 October 2017

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

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

zbMATH Keywords

planar graphsoriented graphspush operationoriented cliques

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Directed graphs (digraphs), tournaments (05C20)

Related Items (6)

Unnamed Item ⋮ On the pushable chromatic number of various types of grids ⋮ Pushable chromatic number of graphs with maximum average degree at most \(\frac{14}{5}\) ⋮ Triangle-free projective-planar graphs with diameter two: domination and characterization ⋮ Pushable chromatic number of graphs with degree constraints ⋮ Erratum to: ``On oriented cliques with respect to push operation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Homomorphisms and colourings of oriented graphs: an updated survey
• On graphs that can be oriented as diagrams of ordered sets
• On reorienting graphs by pushing down maximal vertices
• Homomorphisms and oriented colorings of equivalence classes of oriented graphs
• On homomorphisms of oriented graphs with respect to the push operation
• Outerplanar and Planar Oriented Cliques
• Hamiltonicity and reversing arcs in digraphs
• Tournament games and positive tournaments
• Domination in planar graphs with small diameter*
• Analogues of cliques for oriented coloring

This page was built for publication: On oriented cliques with respect to push operation