Relative clique number of planar signed graphs

DOI10.1007/978-3-319-29221-2_28MaRDI QIDQ2795959zbMATH OpenOpenAlexFDO

Authors Sandip Das, Prantar Ghosh, Swathyprabhu Mj, Sagnik Sen

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 chromatic numbersigned graph homomorphismsigned graphssigned 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)

Recommendations

• Relative clique number of planar signed graphs
• The relative signed clique number of planar graphs is 8
• On oriented relative clique number
• A study on oriented relative clique number
• The relative oriented clique number of triangle-free planar graphs is 10

Cites work

• Homomorphisms and oriented colorings of equivalence classes of oriented graphs
• Homomorphisms of planar signed graphs to signed projective cubes
• Homomorphisms of signed graphs
• scientific article; zbMATH DE number 6303010 (Why is no real title available?)
• On the notion of balance of a signed graph
• On the total coloring of planar graphs.
• Signed graphs
• The complexity of homomorphisms of signed graphs and signed constraint satisfaction

Cited in

(6)

• A study on oriented relative clique number
• Relative clique number of planar signed graphs
• Concepts of signed graph coloring
• The relative signed clique number of planar graphs is 8
• On oriented relative clique number
• The relative oriented clique number of triangle-free planar graphs is 10

This page was built for publication: Relative clique number of planar signed graphs

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