Synapse
⌘+K
Synapse
PulseExploreClubsResearchersJournals
Instagram
HomeClubsExplore
April 11, 2024Discrete Mathematics Algorithms and Applications

On Strong Incidence Coloring of Subcubic Graphs

View Full Paper
Ask AI
Bookmark
Share

Authors

FMFatemeh Sadat MousaviMNMasoumeh Nouri

Discussion

Loading...

Member takes

Overview

Key Points

Key points are not available for this paper at this time.

Cite This Study

Mousavi et al. (2024) studied this question.

synapsesocial.com/papers/68e6f85fb6db6435876734cahttps://doi.org/10.1142/s1793830924500460
View Full Paper
Ask AI
Bookmark
Share

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1Strong list-chromatic index of subcubic graphs is at most 102025
  2. 2Edge incident 2-edge coloring of Graphs2024
  3. 3Rich edge-colorings of subcubic graphs2026
  4. 4The Smallest Subcubic Graph Without a Crumby Coloring2026
  5. 5Incidence theorems for multivariate polynomials over finite fields2025