Classification of edge-critical underlying absolute planar cliques for signed graphs

zbMATH Open1444.05062MaRDI QIDQ3300693FDOQ3300693

Authors Julien Bensmail, Soumen Nandi, Mithun Roy, Sagnik Sen

Publication date 29 July 2020

Full work available at URL http://ajc.maths.uq.edu.au/pdf/77/ajc_v77_p117.pdf

zbMATH Keywords

(0,2)-absolute cliqueclosed walk of a signed graph

Mathematics Subject Classification ID

Signed and weighted graphs (05C22) Enumeration in graph theory (05C30)

Recommendations

• Homomorphisms of signed graphs
• Homomorphisms of signed graphs: an update
• On the signed chromatic number of some classes of graphs
• The relative signed clique number of planar graphs is 8
• Relative clique number of planar signed graphs

Cites work

• scientific article; zbMATH DE number 2117181 (Why is no real title available?)
• scientific article; zbMATH DE number 3259770 (Why is no real title available?)
• Analogues of cliques for \((m,n)\)-colored mixed graphs
• Colored homomorphisms of colored mixed graphs
• Erratum to: ``On oriented cliques with respect to push operation
• Good and semi-strong colorings of oriented planar graphs
• Homomorphism bounds and edge-colourings of \(K_{4}\)-minor-free 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 planar signed graphs to signed projective cubes
• Homomorphisms of signed graphs
• Homomorphisms of signed graphs: an update
• Lower bounds for the colored mixed chromatic number of some classes of graphs.
• On homomorphisms of oriented graphs with respect to the push operation
• On oriented cliques with respect to push operation
• On oriented graphs with certain extension properties.
• On oriented relative clique number
• Outerplanar and planar oriented cliques
• Relative clique number of planar signed graphs
• The complexity of signed graph and edge-coloured graph homomorphisms
• The relative signed clique number of planar graphs is 8
• Walk-powers and homomorphism bounds of planar signed graphs

Cited in

(4)

• On the signed chromatic number of some classes of graphs
• The chromatic number of signed graphs with bounded maximum average degree
• On the chromatic numbers of signed triangular and hexagonal grids
• On coloring parameters of triangle-free planar \((n, m)\)-graphs

This page was built for publication: Classification of edge-critical underlying absolute planar cliques for signed graphs

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