scientific article; zbMATH DE number 3215864
From MaRDI portal
Publication:5342984
Recommendations
Cited in
(78)- Closest 4-leaf power is fixed-parameter tractable
- Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3
- Minimum weakly fundamental cycle bases are hard to find
- A generalization of Talbot's theorem about King Arthur and his knights of the round table
- Linear connectivity forces large complete bipartite minors
- The total chromatic number of regular graphs of high degree
- Edge-disjoint circuits in graphs on the torus
- A two-person game on graphs where each player tries to encircle his opponent's men
- Total chromatic number of graphs of odd order and high degree
- Totally critical even order graphs
- Disjoint cocircuits in matroids with large rank
- The total chromatic number of graphs of even order and high degree
- A condition for a graph to contain k-matching.
- Approximating minimum feedback vertex sets in hypergraphs
- Efficient enumeration of graph orientations with sources
- The confirmation of a conjecture on disjoint cycles in a graph
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
- The Erdős-Pósa property for edge-disjoint immersions in 4-edge-connected graphs
- On the minors of an incidence matrix and Smith normal form
- Maximum graphs not spannable by \(r\) disjoint paths
- Nearly sign-nonsingular matrices
- On independent cycles and edges in graphs
- The number of circles of a maximum state of a plane graph with applications
- Distance spectrum, 1-factor and vertex-disjoint cycles
- Disjoint complete minors and bipartite minors
- Excluding a planar graph from \(\mathrm{GF}(q)\)-representable matroids
- A tight Erdős-Pósa function for long cycles
- Minimum degree conditions for vertex-disjoint even cycles in large graphs
- Non-zero disjoint cycles in highly connected group labelled graphs
- Bounding the number of circuits of a graph
- The total chromatic number of regular graphs of even order and high degree
- Ramsey number of paths and connected matchings in Ore-type host graphs
- Parity linkage and the Erdős-Pósa property of odd cycles through prescribed vertices in highly connected graphs
- Disjoint even cycles packing
- Chordal editing is fixed-parameter tractable
- Scattered packings of cycles
- On maximal paths and circuits of graphs
- Non-zero disjoint cycles in highly connected group labeled graphs
- Approximate min-max relations on plane graphs
- Edge-simple circuits through 10 ordered vertices in square grids
- scientific article; zbMATH DE number 3957150 (Why is no real title available?)
- scientific article; zbMATH DE number 4101249 (Why is no real title available?)
- The Erdős-Pósa property for clique minors in highly connected graphs
- A note on disjoint cycles
- Note on independent sets of a graph
- Fixed-parameter tractability for the subset feedback set problem and the \(S\)-cycle packing problem
- The number of circuits of length 4 in \(\mathrm{PSL}(2,\mathbb{Z})\)-space
- On feedback vertex set: new measure and new structures
- Packing and covering induced subdivisions
- Erdős-Pósa property for labeled minors: 2-connected minors
- Maximum cycle packing using SPR-trees
- Lipschitz-free spaces on finite metric spaces
- A naive algorithm for feedback vertex set
- On Independent Circuits Contained in a Graph
- Packing Edge-Disjoint Odd Eulerian Subgraphs Through Prescribed Vertices in 4-Edge-Connected Graphs
- On the maximal number of independent circuits in a graph
- List-coloring graphs without subdivisions and without immersions
- Erdős-Pósa property and its algorithmic applications: parity constraints, subset feedback set, and subset packing
- An \(A_\alpha\)-spectral Erdős-Pósa theorem
- Rooted prism-minors and disjoint cycles containing a specified edge
- Total colorings of complete multipartite graphs using amalgamations
- Spectral extremal problem on t copies of -cycles
- A sufficient condition for complete multipartite graphs to be of type 1
- Polyhedral aspects of feedback vertex set and pseudoforest deletion set
- Maintaining \(\mathrm{CMSO}_2\) properties on dynamic structures with bounded feedback vertex number
- On the saturation spectrum of the unions of disjoint cycles
- Disjoint cycles and degree sum condition in a graph
- The bipartite Turán number of independent cycles with different lengths
- Some exact and asymptotic results for hypergraph Turán problems in _2-norm
- Maximum spread of graphs with the hereditarily bounded property
- A general theorem in spectral extremal graph theory
- Spectral radius of bipartite graphs with chorded cycles
- Graphs without two vertex-disjoint S-cycles
- The Erdős-Pósa property for vertex- and edge-disjoint odd cycles in graphs on orientable surfaces
- Disjoint unions of complete minors
- Packing edge-disjoint cycles in graphs and the cyclomatic number
- Packing disjoint cycles over vertex cuts
- Distributing vertices along a Hamiltonian cycle in Dirac graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5342984)
