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)

• 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
• 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
• Degree condition for subdivisions of unicyclic graphs
• Vertex-disjoint claws in graphs
• Fan-type condition on disjoint cycles in a graph
• Partial Degree Conditions and Cycle Coverings
• On independent cycles and edges in graphs
• Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
• Neighborhood unions and disjoint chorded cycles in graphs
• TILING DIRECTED GRAPHS WITH TOURNAMENTS
• Disjoint cycles in graphs with distance degree sum conditions
• Disjoint long cycles in a graph
• Disjoint triangles and quadrilaterals in a graph
• Disjoint cliques in claw-free graphs
• Decompositions of graphs into cycles with chords
• On Enomoto's problems in a bipartite graph
• Ore-type conditions implying 2-factors consisting of short cycles
• The \((2k-1)\)-connected multigraphs with at most \(k-1\) disjoint cycles
• On a tiling conjecture of Komlós for 3-chromatic graphs.
• On vertex-disjoint cycles and degree sum conditions
• Properly colored cycles of different lengths in edge-colored complete graphs
• On the existence of vertex-disjoint subgraphs with high degree sum
• Cycles of Given Size in a Dense Graph
• Bandwidth, treewidth, separators, expansion, and universality
• Disjoint directed cycles in directed graphs
• F$F$‐factors in Quasi‐random Hypergraphs
• Subdivisions of graphs: A generalization of paths and cycles
• Partition of a directed bipartite graph into two directed cycles
• On a conjecture on directed cycles in a directed bipartite graph
• Disjoint cycles in graphs with restricted independence number
• Covering vertices of a graph by \(k\) disjoint cycles
• Triangles in claw-free graphs
• Vertex-disjoint hexagons with chords in a bipartite graph
• Two disjoint cycles in digraphs
• Disjoint directed cycles with specified lengths in directed bipartite graphs
• Graphs containing every 2-factor
• An Extension of the Hajnal–Szemerédi Theorem to Directed Graphs
• Forcing a sparse minor
• Covering and tiling hypergraphs with tight cycles
• Title not available (Why is that?)
• 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
• 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
• Blow-up lemma
• On a Ramsey--Turán Variant of the Hajnal--Szemerédi Theorem
• Disjoint cycles in digraphs
• How tight is the corner relaxation? Insights gained from the stable set problem
• 2-factors in dense graphs
• Extremal Theorems for Degree Sequence Packing and the Two-Color Discrete Tomography Problem
• 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
• \(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

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)