On clique numbers of colored mixed graphs

DOI10.1016/J.DAM.2022.08.013MaRDI QIDQ2097162zbMATH OpenOpenAlexFDO

Authors Dipayan Chakraborty, Sandip Das, Soumen Nandi, Debdeep Roy, Sagnik Sen

Publication date 11 November 2022

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

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

zbMATH Keywords

clique numbercolored mixed graphdegreepartial 2-treesplanar graphssubcubic

Mathematics Subject Classification ID

Trees (05C05) 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)

Abstract: An (m,n)-colored mixed graph, or simply, an (m,n)-graph is a graph having m different types of arcs and n different types of edges. A homomorphism of an (m,n)-graph G to another (m,n)-graph H is a vertex mapping that preserves adjacency, the type thereto and the direction. A subset R of the set of vertices of G that always maps distinct vertices in itself to distinct image vertices under any homomorphism is called an (m,n)-relative clique of G. The maximum cardinality of an (m,n)-relative clique of a graph is called the (m,n)-relative clique number of the graph. In this article, we explore the (m,n)-relative clique numbers for various families of graphs.

Recommendations

• Analogues of cliques for \((m,n)\)-colored mixed graphs
• On chromatic number of colored mixed graphs
• Chromatic number of sparse colored mixed planar graphs
• Homomorphisms of planar \((m,n)\)-colored-mixed graphs to planar targets
• On two coloring problems in mixed graphs

Cites work

• A study on oriented relative clique number
• Analogues of cliques for \((m,n)\)-colored mixed graphs
• Analogues of cliques for oriented coloring
• Chromatic number of sparse colored mixed planar graphs
• Colored homomorphisms of colored mixed graphs
• scientific article; zbMATH DE number 3497930 (Why is no real title available?)
• Light subgraphs of graphs embedded in the plane. A survey
• Lower bounds for the colored mixed chromatic number of some classes of graphs.
• On chromatic number of colored mixed graphs
• Outerplanar and planar oriented cliques

Cited in

(7)

• Homomorphisms of planar \((m,n)\)-colored-mixed graphs to planar targets
• Analogues of cliques for \((m,n)\)-colored mixed graphs
• Triangle-free projective-planar graphs with diameter two: domination and characterization
• Chromatic number of sparse colored mixed planar graphs
• Lower bounds for the colored mixed chromatic number of some classes of graphs.
• On ( n , m )-chromatic numbers of graphs with bounded sparsity parameters
• On coloring parameters of triangle-free planar (n, m)-graphs

This page was built for publication: On clique numbers of colored mixed graphs

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