On the maximal number of independent circuits in a graph
From MaRDI portal
Publication:5728985
Cited in
(only showing first 100 items - show all)- scientific article; zbMATH DE number 7479739 (Why is no real title available?)
- Disjoint directed cycles in directed graphs
- Cycles of Given Size in a Dense Graph
- Triangles in claw-free graphs
- Vertex-disjoint hexagons with chords in a bipartite graph
- A refinement of theorems on vertex-disjoint chorded cycles
- \(K_{1,3}\)-factors in graphs
- On the existence of vertex-disjoint subgraphs with high degree sum
- On Enomoto's problems in a bipartite graph
- Ore-type conditions implying 2-factors consisting of short cycles
- On a conjecture on directed cycles in a directed bipartite graph
- Neighborhood unions and disjoint chorded cycles in graphs
- Sharp minimum degree conditions for the existence of disjoint theta graphs
- Cycle multiplicity of some total graphs
- Independence number and vertex-disjoint cycles
- Vertex-disjoint claws in graphs
- Disjoint cycles in graphs with restricted independence number
- The \((2k-1)\)-connected multigraphs with at most \(k-1\) disjoint cycles
- On a tiling conjecture of Komlós for 3-chromatic graphs.
- Disjoint cycles in graphs with distance degree sum conditions
- F$F$‐factors in Quasi‐random Hypergraphs
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Tiling directed graphs with tournaments
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
- Subdivisions of graphs: A generalization of paths and cycles
- Ore-type conditions for bipartite graphs containing hexagons
- Disjoint long cycles in a graph
- On independent doubly chorded cycles
- Vertex-disjoint cycles of the same length.
- Decompositions of graphs into cycles with chords
- Partition of a directed bipartite graph into two directed cycles
- Two disjoint cycles in digraphs
- Disjoint cycles and chorded cycles in a graph with given minimum degree
- Disjoint directed cycles with specified lengths in directed bipartite graphs
- Packing disjoint cycles over vertex cuts
- Cycle factors in dense graphs
- Partial degree conditions and cycle coverings in bipartite graphs
- Partial Degree Conditions and Cycle Coverings
- Embedding spanning subgraphs of small bandwidth
- Bandwidth, treewidth, separators, expansion, and universality
- Fan-type condition on disjoint cycles in a graph
- Disjoint triangles and quadrilaterals in a graph
- Degree condition for subdivisions of unicyclic graphs
- Disjoint Chorded Cycles of the Same Length
- Disjoint cliques in claw-free graphs
- On vertex-disjoint cycles and degree sum conditions
- Spanning embeddings of arrangeable graphs with sublinear bandwidth
- Covering the vertices of a digraph by cycles of prescribed length
- Vertex-disjoint double chorded cycles in bipartite graphs
- A two-person game on graphs where each player tries to encircle his opponent's men
- Covering vertices of a graph by \(k\) disjoint cycles
- Independent cycles with limited size in a graph
- Properly colored cycles of different lengths in edge-colored complete graphs
- On independent cycles and edges in graphs
- Disjoint triangles and quadrilaterals in a graph
- On the minors of an incidence matrix and Smith normal form
- Corrádi and Hajnal's theorem for sparse random graphs
- Minimum degree conditions for vertex-disjoint even cycles in large graphs
- Almost \(H\)-factors in dense graphs
- Approximate multipartite version of the Hajnal-Szemerédi theorem
- Graph partition into small cliques
- Graph factors and factorization: 1985--2003: a survey
- Vertex-disjoint cycles containing specified vertices in a bipartite graph
- Spanning 3-colourable subgraphs of small bandwidth in dense graphs
- On the KŁR conjecture in random graphs
- Quadripartite version of the Hajnal-Szemerédi theorem
- The confirmation of a conjecture on disjoint cycles in a graph
- The point-arboricity of a graph
- On independent triples and vertex-disjoint chorded cycles in graphs
- Proof of the Erdős-Faudree conjecture on quadrilaterals
- Star-factors in graphs with large minimum degree
- Perfect packings with complete graphs minus an edge
- K4−‐factor in a graph
- Proof of the bandwidth conjecture of Bollobás and Komlós
- On quadrilaterals in a graph
- A note on disjoint cycles
- Strengthening Theorems of Dirac and Erdős on Disjoint Cycles
- Vertex-disjoint quadrilaterals in graphs
- Sharpening an ore-type version of the Corrádi-Hajnal theorem
- Subgraphs with triangular components
- A conjecture of Verstraëte on vertex-disjoint cycles
- \(F\)-factors in hypergraphs via absorption
- On the Corrádi-Hajnal theorem and a question of Dirac
- 2-factors in dense graphs
- A refinement of a result of Corrádi and Hajnal
- A degree sequence Hajnal-Szemerédi theorem
- Vertex-disjoint chorded cycles in a graph
- Vertex-disjoint quadrilaterals containing specified edges in a bipartite graph
- Disjoint even cycles packing
- Neighborhood unions for the existence of disjoint chorded cycles in graphs
- On directed versions of the Corrádi-Hajnal corollary
- Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs
- Covering and tiling hypergraphs with tight cycles
- A common extension of the Erdős-Stone theorem and the Alon-Yuster theorem for unbounded graphs
- Disjoint cycles of order at least 5
- Tiling multipartite hypergraphs in quasi-random hypergraphs
- Equitable and proportional coloring of trees
- Asymptotic multipartite version of the Alon-Yuster theorem
- Blow-up lemma
- An extension of the Hajnal-Szemerédi theorem to directed graphs
This page was built for publication: On the maximal number of independent circuits in a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5728985)
