Uniquely forced perfect matching and unique 3-edge-coloring (Q323081): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(9 intermediate revisions by 7 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2016.07.002 / rank
Normal rank
 
Property / author
 
Property / author: Ye-Zhou Wu / rank
Normal rank
 
Property / author
 
Property / author: Ye-Zhou Wu / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C70 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C15 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6636299 / rank
 
Normal rank
Property / zbMATH Keywords
 
matching
Property / zbMATH Keywords: matching / rank
 
Normal rank
Property / zbMATH Keywords
 
unique 3-edge-coloring
Property / zbMATH Keywords: unique 3-edge-coloring / rank
 
Normal rank
Property / zbMATH Keywords
 
cubic graph
Property / zbMATH Keywords: cubic graph / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2016.07.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2476908243 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the forced matching numbers of bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3852212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3874228 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric coloring theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating cycles in edge-partitioned graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On forcing matching number of boron-nitrogen fullerene graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3267903 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The four-colour theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of Hamiltonian cycles in certain generalized Petersen graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on alternating cycles in edge-coloured graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian weights and unique 3‐edge‐colorings of cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On strong 1-factors and Hamilton weights of cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hexagonal systems with forcing edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forcing bonds of a benzenoid system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forcing matching numbers of fullerene graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Plane elementary bipartite graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2016.07.002 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:24, 9 December 2024

scientific article
Language Label Description Also known as
English
Uniquely forced perfect matching and unique 3-edge-coloring
scientific article

    Statements

    Identifiers