Relative Clique Number of Planar Signed Graphs

DOI10.1007/978-3-319-29221-2_28zbMath1437.05090OpenAlexW2402654904MaRDI QIDQ2795959

Swathyprabhu Mj, Sagnik Sen, Sandip Das, Prantar Ghosh

Publication date: 23 March 2016

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

Full work available at URL: https://doi.org/10.1007/978-3-319-29221-2_28

zbMATH Keywords

planar graphssigned graphssigned chromatic numbersigned graph homomorphismsigned relative clique number

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Signed and weighted graphs (05C22)

Related Items (1)

Concepts of signed graph coloring

Cites Work

• Unnamed Item
• Unnamed Item
• Signed graphs
• Homomorphisms and oriented colorings of equivalence classes of oriented graphs
• On the notion of balance of a signed graph
• On the total coloring of planar graphs.
• Homomorphisms of Signed Graphs
• The Complexity of Homomorphisms of Signed Graphs and Signed Constraint Satisfaction

This page was built for publication: Relative Clique Number of Planar Signed Graphs