A polynomial time algorithm to find star chromatic index on bounded treewidth graphs with given maximum degree

Documenti analoghi

• Algorithm for finding vertex-edge domination number on graphs with bounded treewidth and related problems on planar graphs
  di: Wang, Yichen, et al.
  Pubblicazione: (2026)
• Linear recoloring diameter of degenerate chordal graphs and bounded treewidth graphs
  di: Wang, Yichen, et al.
  Pubblicazione: (2025)
• Inversion diameter and treewidth
  di: Wang, Yichen, et al.
  Pubblicazione: (2024)
• On the zero-free region for the chromatic polynomial of graphs with maximum degree $Δ$ and girth $g$
  di: Fialho, Paula M. S., et al.
  Pubblicazione: (2024)
• On graphs with chromatic number and maximum degree both equal to nine
  di: Galindo, Rachel, et al.
  Pubblicazione: (2024)