Covering a cubic graph by 5 perfect matchings (Q2397531): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Treelike snarks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fulkerson-covers of hypohamiltonian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Cubic Bridgeless Graphs Whose Edge-Set Cannot be Covered by Four Perfect Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Fulkerson conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blocking and anti-blocking pairs of polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on Berge-Fulkerson coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5286666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Perfect Matching Coverings and Even Subgraph Coverings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fulkerson's conjecture and Loupekine snarks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equivalence of two conjectures of Berge and Fulkerson / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte / rank
 
Normal rank
Property / cites work
 
Property / cites work: 1‐Factor and Cycle Covers of Cubic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Factorization of Linear Graphs / rank
 
Normal rank

Revision as of 20:22, 13 July 2024

scientific article
Language Label Description Also known as
English
Covering a cubic graph by 5 perfect matchings
scientific article

    Statements

    Identifiers