On circuits in graphs
From MaRDI portal
Recommendations
Cited in
(63)- A note on almost balanced bipartitions of a graph
- scientific article; zbMATH DE number 4041955 (Why is no real title available?)
- scientific article; zbMATH DE number 871178 (Why is no real title available?)
- scientific article; zbMATH DE number 35586 (Why is no real title available?)
- Packing directed cycles of specified odd length into digraphs and alternating cycles into bipartite graphs
- scientific article; zbMATH DE number 3957150 (Why is no real title available?)
- Disjoint triangles and quadrilaterals in a graph
- Disjoint directed cycles in directed graphs
- An asymptotic version of a conjecture by Enomoto and Ota
- \(K_{1,3}\)-factors in graphs
- Graph factors and factorization: 1985--2003: a survey
- Tutte paths and long cycles in circuit graphs
- Vertex-disjoint cycles containing specified vertices in a bipartite graph
- scientific article; zbMATH DE number 6503891 (Why is no real title available?)
- scientific article; zbMATH DE number 863469 (Why is no real title available?)
- Partition of a bipartite Hamiltonian graph into two cycles
- Partitions of a graph into paths with prescribed endvertices and lengths
- On a conjecture on directed cycles in a directed bipartite graph
- K4−‐factor in a graph
- Tutte cycles in circuit graphs
- Almost-spanning subgraphs with bounded degree in dense graphs
- On the circuit diameter conjecture
- Formulas versus Circuits for Small Distance Connectivity
- Vertex-disjoint quadrilaterals in graphs
- An Ore-type condition for the existence of two disjoint cycles
- scientific article; zbMATH DE number 4087710 (Why is no real title available?)
- Vertex-disjoint claws in graphs
- 2-factors in dense graphs
- Distributing vertices on Hamiltonian cycles
- Hamiltonian cycles with all small even chords
- On degree sequences forcing the square of a Hamilton cycle
- Covering and tiling hypergraphs with tight cycles
- On a tiling conjecture of Komlós for 3-chromatic graphs.
- Disjoint cycles in graphs with distance degree sum conditions
- Degree sum conditions on two disjoint cycles in graphs
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
- Paths and circuits in g-graphs
- Covering and tiling hypergraphs with tight cycles
- Disjoint long cycles in a graph
- Disjoint cycles of order at least 5
- Bounding the number of circuits of a graph
- Partition of a directed bipartite graph into two directed cycles
- scientific article; zbMATH DE number 3999968 (Why is no real title available?)
- \(k\) disjoint cycles containing specified independent vertices
- Disjoint directed cycles with specified lengths in directed bipartite graphs
- Disjoint cycles with partial degree conditions in claw-free graphs
- A greedy algorithm for the social golfer and the Oberwolfach problem
- Cycle factors in dense graphs
- On 2-factors with cycles containing specified edges in a bipartite graph
- Fan-type condition on disjoint cycles in a graph
- Combinatorial and computational aspects of graph packing and graph decomposition
- Proof of a tiling conjecture of Komlós
- Graham's problem on shortest networks for points on a circle
- Disjoint triangles and quadrilaterals in a graph
- Circuits including a given set of vertices
- Tilings in vertex ordered graphs
- On Independent Circuits Contained in a Graph
- Partition of a bipartite graph into cycles
- On non-intersecting Eulerian circuits
- Covering the vertices of a digraph by cycles of prescribed length
- Covering a graph with cycles of length at least 4
- Covering vertices of a graph by \(k\) disjoint cycles
- Distributing vertices along a Hamiltonian cycle in Dirac graphs
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)
