On circuits in graphs

DOI10.1016/0012-365X(84)90050-5zbMATH Open0548.05037MaRDI QIDQ799690FDOQ799690

Mohamed H. El-Zahar

Publication date: 1984

Published in: Discrete Mathematics (Search for Journal in Brave)

Recommendations

• Independent cycles with limited size in a graph
• Publication:4726282
• Circuits including a given set of vertices
• scientific article; zbMATH DE number 4193714
• Two vertex-disjoint cycles in a graph

zbMATH Keywords

minimum degreeindependent circuits

Mathematics Subject Classification ID

Paths and cycles (05C38)

Cited In (62)

• Disjoint cycles with partial degree conditions in claw-free graphs
• On non-intersecting Eulerian circuits
• Almost-spanning subgraphs with bounded degree in dense graphs
• On the circuit diameter conjecture
• Partition of a bipartite graph into cycles
• Tutte paths and long cycles in circuit graphs
• Hamiltonian cycles with all small even chords
• Covering and tiling hypergraphs with tight cycles
• Covering and tiling hypergraphs with tight cycles
• Combinatorial and computational aspects of graph packing and graph decomposition
• On Independent Circuits Contained in a Graph
• Partitions of a graph into paths with prescribed endvertices and lengths
• Tilings in vertex ordered graphs
• Proof of a tiling conjecture of Komlós
• Covering the vertices of a digraph by cycles of prescribed length
• Covering a graph with cycles of length at least 4
• K₄⁻‐factor in a graph
• Degree sum conditions on two disjoint cycles in graphs
• \(K_{1,3}\)-factors in graphs
• Cycle factors in dense graphs
• 2-factors in dense graphs
• Vertex-disjoint quadrilaterals in graphs
• Vertex-disjoint claws in graphs
• Fan-type condition on disjoint cycles in a graph
• Distributing vertices along a Hamiltonian cycle in Dirac graphs
• Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
• A greedy algorithm for the social golfer and the Oberwolfach problem
• Formulas versus Circuits for Small Distance Connectivity
• On Degree Sequences Forcing The Square of a Hamilton Cycle
• Vertex-disjoint cycles containing specified vertices in a bipartite graph
• Title not available (Why is that?)
• Disjoint cycles in graphs with distance degree sum conditions
• Disjoint long cycles in a graph
• \(k\) disjoint cycles containing specified independent vertices
• Disjoint triangles and quadrilaterals in a graph
• Title not available (Why is that?)
• Disjoint triangles and quadrilaterals in a graph
• Title not available (Why is that?)
• An Ore-type condition for the existence of two disjoint cycles
• On a tiling conjecture of Komlós for 3-chromatic graphs.
• On 2-factors with cycles containing specified edges in a bipartite graph
• Graph factors and factorization: 1985--2003: a survey
• Title not available (Why is that?)
• Disjoint directed cycles in directed graphs
• Graham's problem on shortest networks for points on a circle
• Partition of a bipartite Hamiltonian graph into two cycles
• Paths and circuits in g-graphs
• Partition of a directed bipartite graph into two directed cycles
• Title not available (Why is that?)
• An asymptotic version of a conjecture by Enomoto and Ota
• On a conjecture on directed cycles in a directed bipartite graph
• Tutte cycles in circuit graphs
• Distributing vertices on Hamiltonian cycles
• Bounding the number of circuits of a graph
• Covering vertices of a graph by \(k\) disjoint cycles
• Disjoint directed cycles with specified lengths in directed bipartite graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• A NOTE ON ALMOST BALANCED BIPARTITIONS OF A GRAPH
• Title not available (Why is that?)
• Packing directed cycles of specified odd length into digraphs and alternating cycles into bipartite graphs
• Title not available (Why is that?)

This page was built for publication: On circuits in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q799690)