K 4 -free and C6¯-free Planar Matching Covered Graphs (Q2811192): Difference between revisions

@@ Property / DOI @@
-.1002/jgt.21882
@@ Property / DOI: 10.1002/jgt.21882 / rank @@
-Normal rank
@@ Property / cites work @@
+Matching covered graphs and subdivisions of \(K_ 4\) and \(\bar C_ 6\)
+Normal rank
@@ Property / cites work @@
+How to build a brick
@@ Property / cites work: How to build a brick / rank @@
+Normal rank
@@ Property / cites work @@
+Brick decompositions and the matching rank of graphs
+Normal rank
@@ Property / cites work @@
+Ear-decompositions of matching-covered graphs
@@ Property / cites work: Ear-decompositions of matching-covered graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Matching structure and the matching lattice
@@ Property / cites work: Matching structure and the matching lattice / rank @@
+Normal rank
@@ Property / cites work @@
+Generating bricks
@@ Property / cites work: Generating bricks / rank @@
+Normal rank
@@ Property / cites work @@
+Totally odd \(K_4\)-subdivisions in 4-chromatic graphs
+Normal rank
@@ Property / cites work @@
+-Isomorphic Graphs
@@ Property / cites work: 2-Isomorphic Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Proof of Toft's conjecture: Every graph containing no fully odd \(K_4\) is 3-colorable
+Normal rank
@@ Property / DOI @@
+.1002/JGT.21882
@@ Property / DOI: 10.1002/JGT.21882 / rank @@
+Normal rank

<i>K</i> <sub>4</sub> -free and C6¯-free Planar Matching Covered Graphs (Q2811192): Difference between revisions