Permanent index of matrices associated with graphs

zbMath1355.05121arXiv1510.00810MaRDI QIDQ510339

Xuding Zhu, Tsai-Lien Wong

Publication date: 17 February 2017

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1510.00810

zbMATH Keywords

matrixtotal weightingpermanent index

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Signed and weighted graphs (05C22)

Related Items

Total weight choosability of cone graphs, Total weight choosability of graphs with bounded maximum average degree, Graphs with maximum average degree less than \(\frac{11}{4}\) are \((1, 3)\)-choosable, Every nice graph is (1,5)-choosable, Total weight choosability of Mycielski graphs, Every graph is \((2,3)\)-choosable, Total weight choosability for Halin graphs

Cites Work

• Unnamed Item
• Every graph is \((2,3)\)-choosable
• Vertex-coloring 2-edge-weighting of graphs
• A nowhere-zero point in linear mappings
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• Colorings and orientations of graphs
• Edge weights and vertex colours
• Vertex-colouring edge-weightings
• Vertex colouring edge partitions
• How to Increase Robustness of Capable-to-Promise
• Weight choosability of graphs
• Combinatorial Nullstellensatz
• Total weight choosability of graphs
• Total weight choosability of graphs