Irreducible snarks of given order and cyclic connectivity (Q2495514): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Martin Škoviera / rank
Normal rank
 
Property / author
 
Property / author: Martin Škoviera / 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.disc.2006.02.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2064033752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2713660 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of snarks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network-Colourings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4947393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note sur la non existence d'un snark d'ordre 16 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of class two graphs with maximum vertex degree three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5286666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-Completeness of Edge-Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problem Session / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cyclically 6-edge-connected snark of order 118 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Snarks without small cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decompositions and reductions of snarks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost all cubic graphs are Hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification and characterizations of snarks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4529551 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873782 / rank
 
Normal rank

Latest revision as of 17:38, 24 June 2024

scientific article
Language Label Description Also known as
English
Irreducible snarks of given order and cyclic connectivity
scientific article

    Statements