Pages that link to "Item:Q5728985"
From MaRDI portal
The following pages link to On the maximal number of independent circuits in a graph (Q5728985):
Displaying 50 items.
- A degree sequence Hajnal-Szemerédi theorem (Q256981) (← links)
- Decompositions of complete graphs into circulants (Q294538) (← links)
- Vertex-disjoint cycles containing specified vertices in a bipartite graph (Q343781) (← links)
- On the Corrádi-Hajnal theorem and a question of Dirac (Q345076) (← links)
- Neighborhood unions for the existence of disjoint chorded cycles in graphs (Q367086) (← links)
- On directed versions of the Corrádi-Hajnal corollary (Q404438) (← links)
- Approximate multipartite version of the Hajnal-Szemerédi theorem (Q412166) (← links)
- A note on disjoint cycles (Q413261) (← links)
- How tight is the corner relaxation? Insights gained from the stable set problem (Q448970) (← links)
- Combinatorial and computational aspects of graph packing and graph decomposition (Q458446) (← links)
- On the KŁR conjecture in random graphs (Q476516) (← links)
- A refinement of a result of Corrádi and Hajnal (Q520047) (← links)
- Disjoint cycles in digraphs (Q595675) (← links)
- On a sharp degree sum condition for disjoint chorded cycles in graphs (Q604663) (← links)
- Proof of the Erdős-Faudree conjecture on quadrilaterals (Q607681) (← links)
- Vertex-disjoint chorded cycles in a graph (Q614042) (← links)
- A common extension of the Erdős-Stone theorem and the Alon-Yuster theorem for unbounded graphs (Q697080) (← links)
- Vertex-disjoint quadrilaterals in graphs (Q704291) (← links)
- Graph partition into \(K_{3}\)s and \(K_{4}\)s (Q711522) (← links)
- Graph partition into small cliques (Q741755) (← links)
- Edge disjoint placement of graphs (Q754889) (← links)
- Subgraphs with triangular components (Q755595) (← links)
- Neighborhood unions and disjoint chorded cycles in graphs (Q764874) (← links)
- Girth in graphs (Q792338) (← links)
- Sharp minimum degree conditions for the existence of disjoint theta graphs (Q820839) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- Independence number and vertex-disjoint cycles (Q878646) (← links)
- Spanning 3-colourable subgraphs of small bandwidth in dense graphs (Q933679) (← links)
- Quadripartite version of the Hajnal-Szemerédi theorem (Q941371) (← links)
- Subdivisions of graphs: A generalization of paths and cycles (Q941389) (← links)
- Vertex-disjoint quadrilaterals containing specified edges in a bipartite graph (Q949291) (← links)
- Proof of the bandwidth conjecture of Bollobás and Komlós (Q957895) (← links)
- Packing disjoint cycles over vertex cuts (Q973127) (← links)
- Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs (Q976141) (← links)
- \(K_{1,3}\)-factors in graphs (Q998329) (← links)
- Disjoint chorded cycles in graphs (Q998485) (← links)
- On 2-factors with cycles containing specified edges in a bipartite graph (Q1011783) (← links)
- Degree condition for subdivisions of unicyclic graphs (Q1015434) (← links)
- Covering the vertices of a graph with cycles of bounded length (Q1025448) (← links)
- Triangle packings and 1-factors in oriented graphs (Q1026012) (← links)
- On 2-factors with cycles containing specified vertices in a bipartite graph (Q1034963) (← links)
- On Enomoto's problems in a bipartite graph (Q1044262) (← links)
- Ore-type conditions implying 2-factors consisting of short cycles (Q1044946) (← links)
- Partition of a directed bipartite graph into two directed cycles (Q1126308) (← links)
- Equitable and proportional coloring of trees (Q1171064) (← links)
- Covering the vertices of a digraph by cycles of prescribed length (Q1174160) (← links)
- Almost \(H\)-factors in dense graphs (Q1196560) (← links)
- Packings of graphs and applications to computational complexity (Q1250227) (← links)
- A two-person game on graphs where each player tries to encircle his opponent's men (Q1285593) (← links)
- Vertex-disjoint claws in graphs (Q1292832) (← links)
