On Cubic Bridgeless Graphs Whose Edge-Set Cannot be Covered by Four Perfect Matchings (Q2922223): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Created claim: DBLP publication ID (P1635): journals/jgt/EsperetM14, #quickstatements; #temporary_batch_1731508824982
 
(7 intermediate revisions by 5 users not shown)
aliases / en / 0aliases / en / 0
 
On cubic bridgeless graphs whose edge-set cannot be covered by four perfect matchings
description / endescription / en
scientific article
scientific article; zbMATH DE number 6302963
Property / title
 
On cubic bridgeless graphs whose edge-set cannot be covered by four perfect matchings (English)
Property / title: On cubic bridgeless graphs whose edge-set cannot be covered by four perfect matchings (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1293.05290 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-88-7642-475-5_8 / rank
 
Normal rank
Property / published in
 
Property / published in: The Seventh European Conference on Combinatorics, Graph Theory and Applications / rank
 
Normal rank
Property / publication date
 
11 June 2014
Timestamp+2014-06-11T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 11 June 2014 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C38 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q17 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6302963 / rank
 
Normal rank
Property / zbMATH Keywords
 
snarks.
Property / zbMATH Keywords: snarks. / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3126075510 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2622281661 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1301.6926 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering Multigraphs by Simple Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3424771 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generation and properties of snarks / 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: Blocking and anti-blocking pairs of polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: On snarks that are far from being 3-edge colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short Cycle Covers of Graphs with Minimum Degree Three / 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: Shortest coverings of graphs with cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short cycle covers of cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-Completeness of Edge-Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest circuit covers of cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short cycle covers and the cycle double cover conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral decompositions of cubic graphs / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/jgt/EsperetM14 / rank
 
Normal rank

Latest revision as of 16:16, 13 November 2024

scientific article; zbMATH DE number 6302963
  • On cubic bridgeless graphs whose edge-set cannot be covered by four perfect matchings
Language Label Description Also known as
English
On Cubic Bridgeless Graphs Whose Edge-Set Cannot be Covered by Four Perfect Matchings
scientific article; zbMATH DE number 6302963
  • On cubic bridgeless graphs whose edge-set cannot be covered by four perfect matchings

Statements

On Cubic Bridgeless Graphs Whose Edge-Set Cannot be Covered by Four Perfect Matchings (English)
0 references
On cubic bridgeless graphs whose edge-set cannot be covered by four perfect matchings (English)
0 references
0 references
0 references
9 October 2014
0 references
11 June 2014
0 references
Berge-Fulkerson conjecture
0 references
perfect matchings
0 references
shortest cycle cover
0 references
cubic graphs
0 references
snarks
0 references
snarks.
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references