Permanent index of matrices associated with graphs
Tsai-Lien Wong, Xuding Zhu

TL;DR
This paper investigates the permanent index of matrices linked to graphs to establish new results on graph choosability, proving that certain classes of graphs are $(2,2)$-choosable using a reduction method.
Contribution
It introduces a reduction technique for studying the permanent of matrices associated with graphs, leading to new proofs that specific graph classes are $(2,2)$-choosable.
Findings
Subcubic graphs have permanent index 1
2-trees have permanent index 1
Halin graphs and grids have permanent index 1
Abstract
A total weighting of a graph is a mapping which assigns to each element a real number as its weight. The vertex sum of with respect to is . A total weighting is proper if for any edge of . A -list assignment is a mapping which assigns to each vertex a set of permissible weights, and assigns to each edge a set of permissible weights. We say is -choosable if for any -list assignment , there is a proper total weighting of with for each . It was conjectured in [T. Wong and X. Zhu, Total weight choosability of graphs, J. Graph Theory 66 (2011), 198-212] that every graph is -choosable and every graph with no isolated edge is -choosable. A promising tool…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Labeling and Dimension Problems · Graph theory and applications · Advanced Graph Theory Research
