Analogues of cliques for \((m,n)\)-colored mixed graphs

DOI10.1007/s00373-017-1807-2zbMath1371.05071OpenAlexW2963649630MaRDI QIDQ2409513

Sagnik Sen, Christopher Duffy, Julien Bensmail

Publication date: 11 October 2017

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-017-1807-2

zbMATH Keywords

planar graphschromatic numberclique numbergraph homomorphismssigned graphscolored mixed graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (13)

Oriented incidence colourings of digraphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On relative clique number of triangle-free planar colored mixed graphs ⋮ 2-edge-colored chromatic number of grids is at most 9 ⋮ On the signed chromatic number of some classes of graphs ⋮ Chromatic polynomials of 2-edge-coloured graphs ⋮ On the pushable chromatic number of various types of grids ⋮ The chromatic number of 2-edge-colored and signed graphs of bounded maximum degree ⋮ Triangle-free projective-planar graphs with diameter two: domination and characterization ⋮ Oriented colourings of graphs with maximum degree three and four ⋮ Chromatic polynomials of oriented graphs ⋮ On clique numbers of colored mixed graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Homomorphisms and colourings of oriented graphs: an updated survey
• On the oriented chromatic number of grids
• On the complexity of H-coloring
• On acyclic colorings of planar graphs
• Homomorphisms of edge-colored graphs and Coxeter groups
• Good and semi-strong colorings of oriented planar graphs
• Homomorphisms and oriented colorings of equivalence classes of oriented graphs
• Colored homomorphisms of colored mixed graphs
• Weak near-unanimity functions and digraph homomorphism problems
• The complexity of signed graph and edge-coloured graph homomorphisms
• Outerplanar and Planar Oriented Cliques
• The CSP Dichotomy Holds for Digraphs with No Sources and No Sinks (A Positive Answer to a Conjecture of Bang-Jensen and Hell)
• The Complexity of Colouring by Semicomplete Digraphs
• Domination in planar graphs with small diameter*
• Analogues of cliques for oriented coloring
• Homomorphisms of Signed Graphs
• Homomorphisms of 2-edge-colored graphs

This page was built for publication: Analogues of cliques for \((m,n)\)-colored mixed graphs