The following pages link to Some Theorems on Abstract Graphs (Q5812733):
Displayed 50 items.
- Extending cycles in directed graphs (Q580359) (← links)
- Hamiltonian circuits, Hamiltonian paths and branching graphs of benzenoid systems (Q679069) (← links)
- Cycles through specified vertices (Q684399) (← links)
- Applying a condition for a Hamiltonian bipartite graph to be bipancyclic (Q686432) (← links)
- Long cycles and the codiameter of a graph. I (Q749555) (← links)
- Extending cycles in graphs (Q750461) (← links)
- The chromatic index of graphs with large maximum degree, where the number of vertices of maximum degree is relatively small (Q752723) (← links)
- A basis for the cycle space of a 2-connected graph (Q753834) (← links)
- Edge disjoint placement of graphs (Q754889) (← links)
- Regular graphs and edge chromatic number (Q790826) (← links)
- Two theorems on Hamiltonian graphs (Q800937) (← links)
- New sufficient conditions for cycles in graphs (Q801082) (← links)
- Relations between parameters of a graph (Q802633) (← links)
- The Ramsey numbers of large cycles versus wheels (Q856890) (← links)
- Heavy fans, cycles and paths in weighted graphs of large connectivity (Q861792) (← links)
- On the spanning connectivity of graphs (Q864172) (← links)
- Toughness and Hamiltonicity in \(k\)-trees (Q868350) (← links)
- Degree conditions for Hamiltonicity: counting the number of missing edges (Q868355) (← links)
- A generalization of Dirac's theorem on cycles through \(k\) vertices in \(k\)-connected graphs (Q868356) (← links)
- The Ramsey numbers for a cycle of length six or seven versus a clique of order seven (Q870963) (← links)
- An analogue of Dirac's theorem on circular super-critical graphs (Q875063) (← links)
- Subdivision extendibility (Q879940) (← links)
- Coverings of the vertices of a graph by small cycles (Q879941) (← links)
- A degree constraint for uniquely Hamiltonian graphs (Q882780) (← links)
- Algorithms for long paths in graphs (Q884457) (← links)
- The chromatic index of multigraphs that are nearly full (Q910411) (← links)
- Hamiltonian degree conditions which imply a graph is pancyclic (Q912127) (← links)
- The Hamilton spaces of Cayley graphs on abelian groups (Q912863) (← links)
- Some localization theorems on Hamiltonian circuits (Q920111) (← links)
- Factorizations of regular graphs (Q922555) (← links)
- Spanning 3-colourable subgraphs of small bandwidth in dense graphs (Q933679) (← links)
- On covering vertices of a graph by trees (Q941380) (← links)
- Subdivisions of graphs: A generalization of paths and cycles (Q941389) (← links)
- Long paths with endpoints in given vertex-subsets of graphs (Q941396) (← links)
- The Ramsey numbers for stars of even order versus a wheel of order nine (Q942144) (← links)
- Hamiltonian-connected graphs (Q945175) (← links)
- An approximate Dirac-type theorem for \(k\)-uniform hypergraphs (Q949794) (← links)
- On 2-factors with \(k\) components (Q952657) (← links)
- Proof of the bandwidth conjecture of Bollobás and Komlós (Q957895) (← links)
- Non-separating 2-factors of an even-regular graph (Q998434) (← links)
- Distributing vertices along a Hamiltonian cycle in Dirac graphs (Q998458) (← links)
- Cycles through 4 vertices in 3-connected graphs (Q998493) (← links)
- Ore-type versions of Brooks' theorem (Q1003831) (← links)
- A new sufficient condition for Hamiltonian graphs (Q1005735) (← links)
- Proof of a conjecture of Haeggkvist on cycles and independent edges (Q1050353) (← links)
- Long cycles generate the cycle space of a graph (Q1055430) (← links)
- Long cycles in bipartite graphs (Q1059086) (← links)
- A generalization of Dirac's theorem (Q1065022) (← links)
- On a conjecture of Bondy (Q1065023) (← links)
- Longest cycles in regular graphs (Q1070244) (← links)