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

Revision as of 14:18, 8 July 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

instance of

scholarly article

0 references

title

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

Journal of Graph Theory

0 references

The Seventh European Conference on Combinatorics, Graph Theory and Applications

0 references

publication date

9 October 2014

0 references

11 June 2014

0 references

full work available at URL

https://arxiv.org/abs/1301.6926

0 references

zbMATH Keywords

Berge-Fulkerson conjecture

0 references

perfect matchings

0 references

shortest cycle cover

0 references

cubic graphs

0 references

snarks

0 references

snarks.

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Covering Multigraphs by Simple Circuits

0 references

Q3424771

0 references

Generation and properties of snarks

0 references

On Cubic Bridgeless Graphs Whose Edge-Set Cannot be Covered by Four Perfect Matchings

0 references

Blocking and anti-blocking pairs of polyhedra

0 references

On snarks that are far from being 3-edge colorable

0 references

Short Cycle Covers of Graphs with Minimum Degree Three

0 references

The equivalence of two conjectures of Berge and Fulkerson

0 references

Identifiers

zbMATH Open document ID

0 references

0 references

0 references

10.1007/978-88-7642-475-5_8

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2922223

@@ Property / cites work @@
+Covering Multigraphs by Simple Circuits
@@ Property / cites work: Covering Multigraphs by Simple Circuits / rank @@
+Normal rank
@@ Property / cites work @@
+Q3424771
@@ Property / cites work: Q3424771 / rank @@
+Normal rank
@@ Property / cites work @@
+Generation and properties of snarks
@@ Property / cites work: Generation and properties of snarks / rank @@
+Normal rank
@@ Property / cites work @@
+On Cubic Bridgeless Graphs Whose Edge-Set Cannot be Covered by Four Perfect Matchings
+Normal rank
@@ Property / cites work @@
+Blocking and anti-blocking pairs of polyhedra
@@ Property / cites work: Blocking and anti-blocking pairs of polyhedra / rank @@
+Normal rank
@@ Property / cites work @@
+On snarks that are far from being 3-edge colorable
+Normal rank
@@ Property / cites work @@
+Short Cycle Covers of Graphs with Minimum Degree Three
+Normal rank
@@ Property / cites work @@
+The equivalence of two conjectures of Berge and Fulkerson
+Normal rank