On the maximal number of independent circuits in a graph

DOI10.1007/BF01895727zbMATH Open0118.19001OpenAlexW4361866456WikidataQ60060514 ScholiaQ60060514MaRDI QIDQ5728985FDOQ5728985

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)

• Graphs containing every 2-factor
• Extremal theorems for degree sequence packing and the two-color discrete tomography problem
• Forcing a sparse minor
• Covering and tiling hypergraphs with tight cycles
• On the Bollobás–Eldridge Conjecture for Bipartite Graphs
• Combinatorial and computational aspects of graph packing and graph decomposition
• Covering the vertices of a graph with cycles of bounded length
• Minimum degree conditions for vertex-disjoint even cycles in large graphs
• On 2-factors with prescribed properties in a bipartite graph
• A note on disjoint cycles
• Almost \(H\)-factors in dense graphs
• Triangle packings and 1-factors in oriented graphs
• Chromatic number via Turán number
• Graph partition into \(K_{3}\)s and \(K_{4}\)s
• 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
• Proof of a tiling conjecture of Komlós
• K₄⁻‐factor in a graph
• Disjoint cycles of order at least 5
• Edge disjoint placement of graphs
• Girth in graphs
• On the number of independent chorded cycles in a graph
• Decompositions of complete graphs into circulants
• Approximate multipartite version of the Hajnal-Szemerédi theorem
• Quadripartite version of the Hajnal-Szemerédi theorem
• Strengthening Theorems of Dirac and Erdős on Disjoint Cycles
• Packings of graphs and applications to computational complexity
• An extension of the Hajnal-Szemerédi theorem to directed graphs
• Blow-up lemma
• Disjoint cycles in digraphs
• How tight is the corner relaxation? Insights gained from the stable set problem
• 2-factors in dense graphs
• The minimum degree threshold for perfect graph packings
• Transitive triangle tilings in oriented graphs
• Minimum degree and disjoint cycles in claw-free graphs
• Vertex-disjoint quadrilaterals in graphs
• Graph partition into small cliques
• On independent triples and vertex-disjoint chorded cycles in graphs
• A conjecture of Verstraëte on vertex-disjoint cycles
• \(F\)-factors in hypergraphs via absorption
• Vertex-disjoint chorded cycles in a graph
• Star-factors in graphs with large minimum degree
• Large planar subgraphs in dense graphs
• Subgraphs with triangular components
• Asymptotic multipartite version of the Alon-Yuster theorem
• A greedy algorithm for the social golfer and the Oberwolfach problem
• On quadrilaterals in a graph
• Triangles in randomly perturbed graphs
• Tiling multipartite hypergraphs in quasi-random hypergraphs
• Vertex-disjoint cycles containing specified vertices in a bipartite graph
• Spanning 3-colourable subgraphs of small bandwidth in dense graphs
• The point-arboricity of a graph
• Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs
• \(k\) disjoint cycles containing specified independent vertices
• The confirmation of a conjecture on disjoint cycles in a graph
• Equitable and proportional coloring of trees
• On a sharp degree sum condition for disjoint chorded cycles in graphs
• Disjoint triangles and quadrilaterals in a graph
• Corrádi and Hajnal's theorem for sparse random graphs
• On the KŁR conjecture in random graphs
• Proof of the Erdős-Faudree conjecture on quadrilaterals
• Proof of the bandwidth conjecture of Bollobás and Komlós
• Vertex-disjoint quadrilaterals containing specified edges in a bipartite graph
• On a Ramsey-Turán variant of the Hajnal-Szemerédi theorem
• On 2-factors with cycles containing specified edges in a bipartite graph
• Disjoint chorded cycles in graphs
• On 2-factors with cycles containing specified vertices in a bipartite graph
• On the minors of an incidence matrix and Smith normal form
• Graph factors and factorization: 1985--2003: a survey
• Neighborhood unions for the existence of disjoint chorded cycles in graphs
• On the maximum number of independent cycles in a graph
• Sharpening an ore-type version of the Corrádi-Hajnal theorem
• On the Corrádi-Hajnal theorem and a question of Dirac
• A refinement of a result of Corrádi and Hajnal
• A degree condition of 2-factors in bipartite graphs
• Perfect packings with complete graphs minus an edge
• Disjoint even cycles packing
• A refinement of theorems on vertex-disjoint chorded cycles
• Sharp minimum degree conditions for the existence of disjoint theta graphs
• Cycle multiplicity of some total graphs
• Ore-type conditions for bipartite graphs containing hexagons
• Partial degree conditions and cycle coverings in bipartite graphs
• Title not available (Why is that?)
• Disjoint Chorded Cycles of the Same Length
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• Packing disjoint cycles over vertex cuts
• Vertex-disjoint double chorded cycles in bipartite graphs
• Vertex-disjoint cycles of the same length.
• Spanning embeddings of arrangeable graphs with sublinear bandwidth
• Covering the vertices of a digraph by cycles of prescribed length
• Disjoint cycles and chorded cycles in a graph with given minimum degree
• A two-person game on graphs where each player tries to encircle his opponent's men
• \(K_{1,3}\)-factors in graphs
• On independent doubly chorded cycles
• Tiling directed graphs with tournaments
• Cycle factors in dense graphs
• Embedding spanning subgraphs of small bandwidth
• Independent cycles with limited size in a graph
• Independence number and vertex-disjoint cycles

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)