Uniquely forced perfect matching and unique 3-edge-coloring

DOI10.1016/j.dam.2016.07.002zbMath1346.05240OpenAlexW2476908243MaRDI QIDQ323081

Dong Ye, Cun-Quan Zhang, Ye-Zhou Wu

Publication date: 7 October 2016

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

Full work available at URL: https://doi.org/10.1016/j.dam.2016.07.002

zbMATH Keywords

matchingcubic graphunique 3-edge-coloring

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (4)

Some novel minimax results for perfect matchings of hexagonal systems ⋮ Maximizing the minimum and maximum forcing numbers of perfect matchings of graphs ⋮ Forcing and anti-forcing edges in bipartite graphs ⋮ Clar structures vs Fries structures in hexagonal systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Enumeration of Hamiltonian cycles in certain generalized Petersen graphs
• On forcing matching number of boron-nitrogen fullerene graphs
• Forcing matching numbers of fullerene graphs
• Alternating cycles in edge-partitioned graphs
• Geometric coloring theory
• A note on alternating cycles in edge-coloured graphs
• The four-colour theorem
• Plane elementary bipartite graphs
• On the forced matching numbers of bipartite graphs
• Hexagonal systems with forcing edges
• Forcing bonds of a benzenoid system
• Hamiltonian weights and unique 3‐edge‐colorings of cubic graphs
• Maximum matching and a polyhedron with 0,1-vertices
• On strong 1-factors and Hamilton weights of cubic graphs

This page was built for publication: Uniquely forced perfect matching and unique 3-edge-coloring