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

← Older edit

@@ aliases / en / 0 / aliases / en / 0 @@
+On cubic bridgeless graphs whose edge-set cannot be covered by four perfect matchings
@@ description / en / description / 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)
+Normal rank
@@ Property / zbMATH Open document ID @@
+.05290
@@ Property / zbMATH Open document ID: 1293.05290 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/978-88-7642-475-5_8
@@ Property / DOI: 10.1007/978-88-7642-475-5_8 / rank @@
+Normal rank
@@ Property / published in @@
+The Seventh European Conference on Combinatorics, Graph Theory and Applications
+Normal rank
@@ Property / publication date @@
+June 2014Timestamp +2014-06-11T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2014-06-11T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 11 June 2014 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C38
@@ Property / Mathematics Subject Classification ID: 05C38 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q17
@@ Property / Mathematics Subject Classification ID: 68Q17 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6302963
@@ Property / zbMATH DE Number: 6302963 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+snarks.
@@ Property / zbMATH Keywords: snarks. / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2622281661
@@ Property / OpenAlex ID: W2622281661 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.6926
@@ Property / arXiv ID: 1301.6926 / rank @@
+Normal rank
@@ 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
@@ Property / cites work @@
+Shortest coverings of graphs with cycles
@@ Property / cites work: Shortest coverings of graphs with cycles / rank @@
+Normal rank
@@ Property / cites work @@
+Short cycle covers of cubic graphs
@@ Property / cites work: Short cycle covers of cubic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The NP-Completeness of Edge-Coloring
@@ Property / cites work: The NP-Completeness of Edge-Coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Shortest circuit covers of cubic graphs
@@ Property / cites work: Shortest circuit covers of cubic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Short cycle covers and the cycle double cover conjecture
+Normal rank
@@ Property / cites work @@
+Polyhedral decompositions of cubic graphs
@@ Property / cites work: Polyhedral decompositions of cubic graphs / rank @@
+Normal rank
@@ Property / DBLP publication ID @@
+journals/jgt/EsperetM14
@@ 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