The relative signed clique number of planar graphs is 8

DOI10.1007/978-3-030-11509-8_20MaRDI QIDQ2326575zbMATH OpenOpenAlexFDO

Authors Sandip Das, Soumen Nandi, Sagnik Sen, Ritesh Seth

Publication date 10 October 2019

Full work available at URL https://doi.org/10.1007/978-3-030-11509-8_20

zbMATH Keywords

planar graphsrelative clique numbersigned graphs

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
• Relative clique number of planar signed graphs
• Signed planar graphs with \(\Delta \geq 8\) are \(\Delta\)-edge-colorable
• The relative oriented clique number of triangle-free planar graphs is 10
• Signed planar graphs with given circular chromatic numbers
• Planar graphs have two-coloring number at most 8
• Signed clique edge domination numbers of graphs
• Every signed planar graph without cycles of length from 4 to 8 is 3-colorable
• A characterization of signed planar graphs with rank at most 4
• The signed maximum-clique transversal number of regular graphs

Cited in

(4)

• Relative clique number of planar signed graphs
• Relative clique number of planar signed graphs
• Classification of edge-critical underlying absolute planar cliques for signed graphs
• On coloring parameters of triangle-free planar (n, m)-graphs

This page was built for publication: The relative signed clique number of planar graphs is 8

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