One or two disjoint circuits cover independent edges. Lovász-Woodall conjecture (Q1850574): Difference between revisions

@@ Property / DOI @@
-.1006/jctb.2001.2059
@@ Property / DOI: 10.1006/jctb.2001.2059 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1006/jctb.2001.2059
+Normal rank
@@ Property / OpenAlex ID @@
+W2091441627
@@ Property / OpenAlex ID: W2091441627 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3941433
@@ Property / cites work: Q3941433 / rank @@
+Normal rank
@@ Property / cites work @@
+Cycles through specified vertices of a graph
@@ Property / cites work: Cycles through specified vertices of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
+Normal rank
@@ Property / cites work @@
+Any four independent edges of a 4-connected graph are contained in a circuit
+Normal rank
@@ Property / cites work @@
+Circuits through specified edges
@@ Property / cites work: Circuits through specified edges / rank @@
+Normal rank
@@ Property / cites work @@
+Cycles Through Prescribed and Forbidden Point Sets
+Normal rank
@@ Property / cites work @@
+A nine point theorem for 3-connected graphs
@@ Property / cites work: A nine point theorem for 3-connected graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Cycles intersecting a prescribed vertex set
@@ Property / cites work: Cycles intersecting a prescribed vertex set / rank @@
+Normal rank
@@ Property / cites work @@
+Cycles through a prescribed vertex set in \(n\)-connected graphs.
+Normal rank
@@ Property / cites work @@
+One or two disjoint circuits cover independent edges. Lovász-Woodall conjecture
+Normal rank
@@ Property / cites work @@
+Q3972952
@@ Property / cites work: Q3972952 / rank @@
+Normal rank
@@ Property / cites work @@
+On circuits through five edges
@@ Property / cites work: On circuits through five edges / rank @@
+Normal rank
@@ Property / cites work @@
+Note on circuits containing specified edges
@@ Property / cites work: Note on circuits containing specified edges / rank @@
+Normal rank
@@ Property / cites work @@
+Circuits containing specified edges
@@ Property / cites work: Circuits containing specified edges / rank @@
+Normal rank
@@ Property / cites work @@
+The binding number of a graph and its Anderson number
+Normal rank
@@ Property / DOI @@
+.1006/JCTB.2001.2059
@@ Property / DOI: 10.1006/JCTB.2001.2059 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1850574