On relative clique number of triangle-free planar colored mixed graphs

DOI10.1007/978-3-031-06678-8_32MaRDI QIDQ2169979zbMATH OpenOpenAlexFDO

Authors Soumen Nandi, Sagnik Sen, S. Taruni

Publication date 30 August 2022

Full work available at URL https://doi.org/10.1007/978-3-031-06678-8_32

zbMATH Keywords

colored mixed graphshomomorphismplanar graphsrelative clique number

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Cites work

• A study on oriented relative clique number
• Analogues of cliques for \((m,n)\)-colored mixed graphs
• Chromatic number of sparse colored mixed planar graphs
• Colored homomorphisms of colored mixed graphs
• Homomorphisms and colourings of oriented graphs: an updated survey
• Homomorphisms and oriented colorings of equivalence classes of oriented graphs
• Homomorphisms of 2-edge-colored graphs
• Homomorphisms of 2-edge-colored triangle-free planar graphs
• Homomorphisms of edge-colored graphs and Coxeter groups
• Homomorphisms of signed graphs
• Homomorphisms of signed graphs: an update
• Light subgraphs of graphs embedded in the plane. A survey
• Lower bounds for the colored mixed chromatic number of some classes of graphs.
• On oriented relative clique number
• Oriented graph coloring
• Signed graphs
• The chromatic number of oriented graphs
• The relative oriented clique number of triangle-free planar graphs is 10

Cited in

(1)

• On coloring parameters of triangle-free planar (n, m)-graphs

This page was built for publication: On relative clique number of triangle-free planar colored mixed graphs

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