The number of edge 3-colorings of a planar cubic graph as a permanent

DOI10.1016/0012-365X(74)90157-5zbMath0281.05103OpenAlexW1970929688WikidataQ108042943 ScholiaQ108042943MaRDI QIDQ1843574

David E. Scheim

Publication date: 1974

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(74)90157-5

Mathematics Subject Classification ID

Combinatorial identities, bijective combinatorics (05A19) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Matrices of integers (15B36)

Related Items (max. 100)

Antimagic labelling of vertex weighted graphs ⋮ Neighbor sum distinguishing total choosability of planar graphs ⋮ Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited ⋮ Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs ⋮ Application of polynomial method to on-line list colouring of graphs ⋮ On list \((p, 1)\)-total labellings of special planar graphs and 1-planar graphs ⋮ On the neighbor sum distinguishing total coloring of planar graphs ⋮ Weighted-1-antimagic graphs of prime power order ⋮ Neighbor sum distinguishing total coloring of sparse IC-planar graphs ⋮ On two generalizations of the Alon-Tarsi polynomial method ⋮ Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz ⋮ Local antimagic orientations of \(d\)-degenerate graphs ⋮ One More Probabilistic Reformulation of the Four Colour Conjecture ⋮ Parity, Eulerian subgraphs and the Tutte polynomial ⋮ An Application of the combinatorial Nullstellensatz to a graph labelling problem ⋮ Neighbor sum distinguishing total choosability of IC-planar graphs ⋮ List edge colourings of some 1-factorable multigraphs

Cites Work

• Combinatorial structure on triangulations. I: The structure of four colorings
• Unnamed Item
• Unnamed Item

This page was built for publication: The number of edge 3-colorings of a planar cubic graph as a permanent