Parity Linkage and the Erdős–Pósa Property of Odd Cycles through Prescribed Vertices in Highly Connected Graphs (Q4978443): Difference between revisions

Latest revision as of 06:34, 14 July 2024

scientific article; zbMATH DE number 6759332

Language	Label	Description	Also known as
English	Parity Linkage and the Erdős–Pósa Property of Odd Cycles through Prescribed Vertices in Highly Connected Graphs	scientific article; zbMATH DE number 6759332

Statements

instance of

scholarly article

0 references

title

Parity Linkage and the Erdős–Pósa Property of Odd Cycles through Prescribed Vertices in Highly Connected Graphs (English)

0 references

zbMATH Open document ID

0 references

0 references

0 references

Journal of Graph Theory

0 references

publication date

10 August 2017

0 references

full work available at URL

https://arxiv.org/abs/1411.6554

0 references

Mathematics Subject Classification ID

0 references

0 references

cycles

0 references

packing

0 references

covering

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

0 references

The Erdős-Pósa property for long circuits

0 references

Cycles through specified vertices of a graph

0 references

In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen

0 references

On the odd-minor variant of Hadwiger's conjecture

0 references

Half-integral packing of odd cycles through prescribed vertices

0 references

Packing cycles through prescribed vertices

0 references

Highly parity linked graphs

0 references

Non-zero disjoint cycles in highly connected group labelled graphs

0 references

Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte

0 references

Disjoint cycles intersecting a set of vertices

0 references

The Erdős-Pósa property for odd cycles in highly connected graphs

0 references

Mangoes and blueberries

0 references

Graph minors. V. Excluding a planar graph

0 references

An improved linear edge bound for graph linkages

0 references

The Erdős-Pósa property for odd cycles in graphs of large connectivity

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4978443

@@ Property / cites work @@
+The Erdős-Pósa property for long circuits
@@ Property / cites work: The Erdős-Pósa property for long circuits / 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 @@
+On the odd-minor variant of Hadwiger's conjecture
@@ Property / cites work: On the odd-minor variant of Hadwiger's conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+Half-integral packing of odd cycles through prescribed vertices
+Normal rank
@@ Property / cites work @@
+Packing cycles through prescribed vertices
@@ Property / cites work: Packing cycles through prescribed vertices / rank @@
+Normal rank
@@ Property / cites work @@
+Highly parity linked graphs
@@ Property / cites work: Highly parity linked graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Non-zero disjoint cycles in highly connected group labelled graphs
+Normal rank
@@ Property / cites work @@
+Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte
+Normal rank
@@ Property / cites work @@
+Disjoint cycles intersecting a set of vertices
@@ Property / cites work: Disjoint cycles intersecting a set of vertices / rank @@
+Normal rank
@@ Property / cites work @@
+The Erdős-Pósa property for odd cycles in highly connected graphs
+Normal rank
@@ Property / cites work @@
+Mangoes and blueberries
@@ Property / cites work: Mangoes and blueberries / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. V. Excluding a planar graph
@@ Property / cites work: Graph minors. V. Excluding a planar graph / rank @@
+Normal rank
@@ Property / cites work @@
+An improved linear edge bound for graph linkages
@@ Property / cites work: An improved linear edge bound for graph linkages / rank @@
+Normal rank
@@ Property / cites work @@
+The Erdős-Pósa property for odd cycles in graphs of large connectivity
+Normal rank