The following pages link to Sagnik Sen (Q324736):
Displayed 50 items.
- On oriented relative clique number (Q324737) (← links)
- On \(L(k, k - 1, \ldots, 1)\) labeling of triangular lattice (Q324981) (← links)
- A lower bound technique for radio \(k\)-coloring (Q512555) (← links)
- The relative oriented clique number of triangle-free planar graphs is 10 (Q779210) (← links)
- Erratum to: ``On oriented cliques with respect to push operation'' (Q1732122) (← links)
- A study on oriented relative clique number (Q1752681) (← links)
- Oriented bipartite graphs and the Goldbach graph (Q2037582) (← links)
- On subgraph complementation to \(H\)-free Graphs (Q2088585) (← links)
- On clique numbers of colored mixed graphs (Q2097162) (← links)
- On fractional version of oriented coloring (Q2143042) (← links)
- On relative clique number of triangle-free planar colored mixed graphs (Q2169979) (← links)
- Relative clique number of planar signed graphs (Q2181247) (← links)
- Pushable chromatic number of graphs with degree constraints (Q2219941) (← links)
- The relative signed clique number of planar graphs is 8 (Q2326575) (← links)
- On homomorphisms of oriented graphs with respect to the push operation (Q2397542) (← links)
- Analogues of cliques for \((m,n)\)-colored mixed graphs (Q2409513) (← links)
- On oriented cliques with respect to push operation (Q2410221) (← links)
- \(L(2,1)\)-labelings of some families of oriented planar graphs (Q2442267) (← links)
- Walk-powers and homomorphism bounds of planar signed graphs (Q2631091) (← links)
- Burning spiders (Q2636560) (← links)
- On oriented \(L(p,1)\)-labeling (Q2636569) (← links)
- On the signed chromatic number of some classes of graphs (Q2666564) (← links)
- On subgraph complementation to \(H\)-free graphs (Q2672430) (← links)
- On the pushable chromatic number of various types of grids (Q2686138) (← links)
- Triangle-free projective-planar graphs with diameter two: domination and characterization (Q2691564) (← links)
- A homomorphic polynomial for oriented graphs (Q2692188) (← links)
- Relative Clique Number of Planar Signed Graphs (Q2795959) (← links)
- Outerplanar and Planar Oriented Cliques (Q2811201) (← links)
- (Q2857442) (← links)
- Maximum Order of a Planar Oclique Is 15 (Q2876568) (← links)
- On Local Structures of Cubicity 2 Graphs (Q2958318) (← links)
- On Chromatic Number of Colored Mixed Graphs (Q2971641) (← links)
- (Q3300693) (← links)
- (Q4995318) (← links)
- On a Special Class of Boxicity 2 Graphs (Q5174960) (← links)
- Homomorphisms of 2‐Edge‐Colored Triangle‐Free Planar Graphs (Q5272645) (← links)
- (Q5420033) (← links)
- Cops and robber on some families of oriented graphs (Q5896831) (← links)
- On rectangle intersection graphs with stab number at most two (Q5919053) (← links)
- Cops and robber on some families of oriented graphs (Q5919473) (← links)
- On rectangle intersection graphs with stab number at most two (Q5919634) (← links)
- On deeply critical oriented cliques (Q6047971) (← links)
- New bounds and constructions for neighbor-locating colorings of graphs (Q6132528) (← links)
- Cops and robber on oriented graphs with respect to push operation (Q6132547) (← links)
- Pushable chromatic number of graphs with maximum average degree at most \(\frac{14}{5}\) (Q6157430) (← links)
- On radio \(k\)-labeling of the power of the infinite path (Q6161446) (← links)
- A linear algorithm for radio \(k\)-coloring powers of paths having small diameter (Q6182900) (← links)
- Homomorphisms of signed planar graphs (Q6248111) (← links)
- Analogous to cliques for (m,n)-colored mixed graphs (Q6256775) (← links)
- Chromatic number of signed graphs with bounded maximum degree (Q6272050) (← links)
