Classification of edge-critical underlying absolute planar cliques for signed graphs
From MaRDI portal
Publication:3300693
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Good and semi-strong colorings of oriented planar graphs
- Homomorphisms and oriented colorings of equivalence classes of oriented graphs
- Homomorphisms and colourings of oriented graphs: an updated survey
- On oriented graphs with certain extension properties.
- Outerplanar and planar oriented cliques
- Title not available (Why is that?)
- Relative clique number of planar signed graphs
- On oriented cliques with respect to push operation
- On oriented relative clique number
- Homomorphisms of edge-colored graphs and Coxeter groups
- Colored homomorphisms of colored mixed graphs
- The complexity of signed graph and edge-coloured graph homomorphisms
- Homomorphisms of 2-edge-colored triangle-free planar graphs
- Homomorphisms of 2-edge-colored graphs
- Homomorphisms of signed graphs
- Homomorphisms of planar signed graphs to signed projective cubes
- Homomorphisms of signed graphs: an update
- Walk-powers and homomorphism bounds of planar signed graphs
- Homomorphism bounds and edge-colourings of \(K_{4}\)-minor-free graphs
- Analogues of cliques for \((m,n)\)-colored mixed graphs
- Erratum to: ``On oriented cliques with respect to push operation
- Lower bounds for the colored mixed chromatic number of some classes of graphs.
- On homomorphisms of oriented graphs with respect to the push operation
- The relative signed clique number of planar graphs is 8
Cited In (4)
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)