A look at cycles containing specified elements of a graph (Q1045026): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Ronald J. Gould / rank
Normal rank
 
Property / author
 
Property / author: Ronald J. Gould / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2008.04.017 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2126610278 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclability and pancyclability in bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of a result of Häggkvist and Nicoghossian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles through specified vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pancyclic graphs. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles through specified vertices of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles through subsets with large degree sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles through given vertices and closures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4350166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-disjoint cycles containing specified vertices in a bipartite graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2712508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear forests and ordered cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 2-factors containing 1-factors in bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5475533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tough graphs and Hamiltonian circuits. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on Hamiltonian circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of a theorem of Dirac / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3918148 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two‐factors each component of which contains a specified vertex / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles and paths through specified vertices in k-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-disjoint cycles containing specified edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: New sufficient conditions for cycles in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3620654 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4518332 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalizing pancyclic and \(k\)-ordered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal degree and \((k,m)\)-pancyclic ordered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pancyclic graphs and linear forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree conditions for <i>k</i>‐ordered hamiltonian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Ore-type condition for pancyclability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4879172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonism, degree sum and neighborhood intersections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden subgraphs and the existence of paths and cycles passing through specified vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4825847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum degree conditions for cycles including specified sets of vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On short cycles through prescribed vertices of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3912829 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circuits through prescribed vertices in <i>k</i>‐connected <i>k</i>‐regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circuits through specified edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: On paths and cycles through specified vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4500706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3960729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles Through Prescribed and Forbidden Point Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex‐disjoint cycles containing prescribed vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles intersecting a prescribed vertex set / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Hamiltonian cycle in which specified vertices are uniformly distributed / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles through a prescribed vertex set in \(n\)-connected graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cycles through prescribed vertices in weakly separable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4265584 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2716020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extremal problem for <i>H</i>‐linked graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalization of a Theorem of Posa / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2716016 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-disjoint 4-cycles containing specified edges in a bipartite graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles through edges in cyclically \(k\)-connected cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclability of <i>r</i>-regular <i>r</i>-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular \(n\)-valent \(n\)-connected non-Hamiltonian non \(n\)-edge-colourable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5284595 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Hamilton Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles through prescribed vertices with large degree sum / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5342985 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2715999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2‐neighborhoods and hamiltonian conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4552236 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5313246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles through \(k+2\) vertices in \(k\)-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles and Connectivity in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(F\)-Hamiltonian graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:52, 2 July 2024

scientific article
Language Label Description Also known as
English
A look at cycles containing specified elements of a graph
scientific article

    Statements

    A look at cycles containing specified elements of a graph (English)
    0 references
    15 December 2009
    0 references
    0 references
    cycle
    0 references
    Hamiltonian cycle
    0 references
    path
    0 references
    ordered cycle
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references