On circuits in graphs
From MaRDI portal
Publication:799690
DOI10.1016/0012-365X(84)90050-5zbMath0548.05037MaRDI QIDQ799690
Publication date: 1984
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
Tilings in vertex ordered graphs, K4−‐factor in a graph, Degree sum conditions on two disjoint cycles in graphs, Vertex-disjoint cycles containing specified vertices in a bipartite graph, Graph factors and factorization: 1985--2003: a survey, Disjoint cycles in graphs with distance degree sum conditions, Disjoint directed cycles with specified lengths in directed bipartite graphs, On a conjecture on directed cycles in a directed bipartite graph, 2-factors in dense graphs, Partition of a directed bipartite graph into two directed cycles, A greedy algorithm for the social golfer and the Oberwolfach problem, Disjoint directed cycles in directed graphs, Covering and tiling hypergraphs with tight cycles, Hamiltonian cycles with all small even chords, Covering vertices of a graph by \(k\) disjoint cycles, Fan-type condition on disjoint cycles in a graph, On Degree Sequences Forcing The Square of a Hamilton Cycle, Degree conditions for the existence of vertex-disjoint cycles and paths: a survey, Disjoint long cycles in a graph, Combinatorial and computational aspects of graph packing and graph decomposition, On a tiling conjecture of Komlós for 3-chromatic graphs., Covering the vertices of a digraph by cycles of prescribed length, Covering and tiling hypergraphs with tight cycles, Disjoint triangles and quadrilaterals in a graph, Disjoint triangles and quadrilaterals in a graph, Partitions of a graph into paths with prescribed endvertices and lengths, Partition of a bipartite graph into cycles, Covering a graph with cycles of length at least 4, Vertex-disjoint quadrilaterals in graphs, An asymptotic version of a conjecture by Enomoto and Ota, \(K_{1,3}\)-factors in graphs, Distributing vertices along a Hamiltonian cycle in Dirac graphs, Proof of a tiling conjecture of Komlós, \(k\) disjoint cycles containing specified independent vertices, On 2-factors with cycles containing specified edges in a bipartite graph, Unnamed Item, Distributing vertices on Hamiltonian cycles, Vertex-disjoint claws in graphs, Cycle factors in dense graphs, A NOTE ON ALMOST BALANCED BIPARTITIONS OF A GRAPH, An Ore-type condition for the existence of two disjoint cycles, Disjoint cycles with partial degree conditions in claw-free graphs, Almost-spanning subgraphs with bounded degree in dense graphs, Partition of a bipartite Hamiltonian graph into two cycles
