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

DOI10.1007/978-3-031-06678-8_32OpenAlexW4285123828MaRDI QIDQ2169979

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

planar graphshomomorphismrelative clique numbercolored mixed graphs

Mathematics Subject Classification ID

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

Cites Work

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

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