Packing Edge-Disjoint Odd Eulerian Subgraphs Through Prescribed Vertices in 4-Edge-Connected Graphs (Q5346553): Difference between revisions

Latest revision as of 20:48, 13 July 2024

scientific article; zbMATH DE number 6723130

Language	Label	Description	Also known as
English	Packing Edge-Disjoint Odd Eulerian Subgraphs Through Prescribed Vertices in 4-Edge-Connected Graphs	scientific article; zbMATH DE number 6723130

Statements

instance of

scholarly article

0 references

title

Packing Edge-Disjoint Odd Eulerian Subgraphs Through Prescribed Vertices in 4-Edge-Connected Graphs (English)

0 references

author

Naonori Kakimura

0 references

Ken-ichi Kawarabayashi

0 references

Yusuke Kobayashi

0 references

published in

SIAM Journal on Discrete Mathematics

0 references

publication date

24 May 2017

0 references

zbMATH Keywords

cycle packing

0 references

Erdős-Pósa property

0 references

fixed-parameter algorithm

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Linear time algorithms for NP-hard problems restricted to partial k- trees

0 references

A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

0 references

Long cycles through prescribed vertices have the Erdős‐Pósa property

0 references

Highly connected sets and the excluded grid theorem

0 references

Q5342984

0 references

On the odd-minor variant of Hadwiger's conjecture

0 references

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

0 references

Packing cycles through prescribed vertices under modularity constraints

0 references

Half-integral packing of odd cycles through prescribed vertices

0 references

Packing cycles through prescribed vertices

0 references

Q5417629

0 references

Edge-disjoint Odd Cycles in 4-edge-connected Graphs

0 references

Highly parity linked graphs

0 references

The Graph Minor Algorithm with Parity Conditions

0 references

Non-zero disjoint cycles in highly connected group labelled graphs

0 references

A shorter proof of the graph minor algorithm

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

Graph minors. XIII: The disjoint paths problem

0 references

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

0 references

Identifiers

zbMATH Open document ID

1362.05068

0 references

DOI

10.1137/15M1022239

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5346553

@@ Property / cites work @@
+Linear time algorithms for NP-hard problems restricted to partial k- trees
+Normal rank
@@ Property / cites work @@
+A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
+Normal rank
@@ Property / cites work @@
+Long cycles through prescribed vertices have the Erdős‐Pósa property
+Normal rank
@@ Property / cites work @@
+Highly connected sets and the excluded grid theorem
+Normal rank
@@ Property / cites work @@
+Q5342984
@@ Property / cites work: Q5342984 / rank @@
+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 @@
+Parity Linkage and the Erdős–Pósa Property of Odd Cycles through Prescribed Vertices in Highly Connected Graphs
+Normal rank
@@ Property / cites work @@
+Packing cycles through prescribed vertices under modularity constraints
+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 @@
+Q5417629
@@ Property / cites work: Q5417629 / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-disjoint Odd Cycles in 4-edge-connected Graphs
+Normal rank
@@ Property / cites work @@
+Highly parity linked graphs
@@ Property / cites work: Highly parity linked graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The Graph Minor Algorithm with Parity Conditions
@@ Property / cites work: The Graph Minor Algorithm with Parity Conditions / rank @@
+Normal rank
@@ Property / cites work @@
+Non-zero disjoint cycles in highly connected group labelled graphs
+Normal rank
@@ Property / cites work @@
+A shorter proof of the graph minor algorithm
@@ Property / cites work: A shorter proof of the graph minor algorithm / rank @@
+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 @@
+Graph minors. XIII: The disjoint paths problem
@@ Property / cites work: Graph minors. XIII: The disjoint paths problem / rank @@
+Normal rank
@@ Property / cites work @@
+The Erdős-Pósa property for odd cycles in graphs of large connectivity
+Normal rank