On the maximal number of independent circuits in a graph

DOI10.1007/BF01895727MaRDI QIDQ5728985zbMATH OpenOpenAlexWikidataFDO

Authors

Publication date 1963

Published in Acta Mathematica Academiae Scientiarum Hungaricae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01895727

zbMATH Keywords

topology

Cites work

• On the maximal number of independent circuits in a graph

Cited in

(only showing first 100 items - show all)

• Edge-dominating cycles in graphs
• Disjoint directed cycles with specified lengths in directed bipartite graphs
• Sharp minimum degree conditions for the existence of disjoint theta graphs
• A refinement of theorems on vertex-disjoint chorded cycles
• Cycle multiplicity of some total graphs
• Two disjoint cycles in digraphs
• The Ramsey numbers of squares of paths and cycles
• Ore-type conditions for bipartite graphs containing hexagons
• Disjoint cycles with partial degree conditions in claw-free graphs
• Graphs containing every 2-factor
• Tight co-degree condition for packing of loose cycles in 3-graphs
• 2-proper partition of a graph
• Results and problems on chorded cycles: a survey
• Partial degree conditions and cycle coverings in bipartite graphs
• Edge-disjoint cycles with the same vertex set
• Tiling edge-ordered graphs with monotone paths and other structures
• The edge condition for independent cycles with chords in bipartite graphs
• scientific article; zbMATH DE number 7479739 (Why is no real title available?)
• Extremal theorems for degree sequence packing and the two-color discrete tomography problem
• Disjoint Chorded Cycles of the Same Length
• Combinatorial and computational aspects of graph packing and graph decomposition
• Triangle-tilings in graphs without large independent sets
• Packing disjoint cycles over vertex cuts
• Forcing a sparse minor
• Covering the vertices of a graph with cycles of bounded length
• Partial degrees on matchings for cycles in bipartite graphs
• Nested cycles with no geometric crossings
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• Embedding graphs having Ore-degree at most five
• Extremal density for sparse minors and subdivisions
• Cyclic triangle factors in regular tournaments
• \(K_r\)-factors in graphs with low independence number
• The number of circuits of length 4 inPSL(2,ℤ)-space
• Covering and tiling hypergraphs with tight cycles
• Minimum degree conditions for vertex-disjoint even cycles in large graphs
• On the Bollobás–Eldridge Conjecture for Bipartite Graphs
• Triangle strings: structures for augmentation of vertex-disjoint triangle sets
• On 2-factors with prescribed properties in a bipartite graph
• A note on disjoint cycles
• Vertex-disjoint double chorded cycles in bipartite graphs
• Vertex-disjoint rainbow triangles in edge-colored graphs
• Tree decompositions of graphs without large bipartite holes
• Degree sum condition for vertex-disjoint 5-cycles
• Turán numbers for vertex-disjoint triangles and pentagons
• Clique factors in pseudorandom graphs
• On degree sum conditions and vertex-disjoint chorded cycles
• Nested cycles with no geometric crossings
• Vertex-disjoint cycles of the same length.
• An improvement of Lichiardopol's theorem on disjoint cycles in tournaments
• Almost \(H\)-factors in dense graphs
• Extremal function of two independent chorded cycles in a bipartite graph
• Disjoint isomorphic balanced clique subdivisions
• Degree sum condition for vertex-disjoint triangles and pentagons
• Graph partition into \(K_{3}\)s and \(K_{4}\)s
• Triangle packings and 1-factors in oriented graphs
• Chromatic number via Turán number
• Analogy of Fan-type condition on weak cycle partition of graphs
• scientific article; zbMATH DE number 3402644 (Why is no real title available?)
• Tiling problems in edge-ordered graphs (extended abstract)
• A degree sequence Hajnal-Szemerédi theorem
• On directed versions of the Corrádi-Hajnal corollary
• A common extension of the Erdős-Stone theorem and the Alon-Yuster theorem for unbounded graphs
• Covering the vertices of a digraph by cycles of prescribed length
• On vertex-disjoint chorded cycles and degree sum conditions
• Covering a graph with cycles of length at least 4
• Tiling tripartite graphs with 3-colorable graphs: the extreme case
• Toward a density Corrádi-Hajnal theorem for degenerate hypergraphs
• Spanning embeddings of arrangeable graphs with sublinear bandwidth
• Proof of a tiling conjecture of Komlós
• Edge disjoint placement of graphs
• Decompositions of complete graphs into circulants
• Girth in graphs
• Disjoint cycles and chorded cycles in a graph with given minimum degree
• K₄⁻‐factor in a graph
• Approximate multipartite version of the Hajnal-Szemerédi theorem
• A two-person game on graphs where each player tries to encircle his opponent's men
• Rooted prism-minors and disjoint cycles containing a specified edge
• \(K_{1,3}\)-factors in graphs
• Quadripartite version of the Hajnal-Szemerédi theorem
• On the number of independent chorded cycles in a graph
• Disjoint cycles of order at least 5
• Packings of graphs and applications to computational complexity
• On independent doubly chorded cycles
• Strengthening Theorems of Dirac and Erdős on Disjoint Cycles
• Towards a weighted version of the Hajnal-Szemerédi theorem
• Triangle factors of graphs without large independent sets and of weighted graphs
• Blow-up lemma
• Cycle factors in dense graphs
• Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022
• How to build a pillar: a proof of Thomassen's conjecture
• Disjoint cycles in digraphs
• Tiling directed graphs with tournaments
• Rainbow spanning structures in graph and hypergraph systems
• An extension of the Hajnal-Szemerédi theorem to directed graphs
• How tight is the corner relaxation? Insights gained from the stable set problem
• Many vertex-disjoint even cycles of fixed length in a graph
• Independent cycles with limited size in a graph
• Embedding clique-factors in graphs with low -independence number
• Powers of Hamilton cycles in dense graphs perturbed by a random geometric graph
• Embedding spanning subgraphs of small bandwidth

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)