Weakly pancyclic graphs (Q1569055)

From MaRDI portal

Revision as of 15:57, 29 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Weakly pancyclic graphs	scientific article

Statements

scholarly article

0 references

Weakly pancyclic graphs (English)

0 references

Béla Bollobás

0 references

Andrew G. Thomason

0 references

Journal of Combinatorial Theory. Series B

0 references

publication date

25 June 2000

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1006/jctb.1999.1916

0 references

Advances in graph theory

0 references

Cycles through specified vertices

0 references

0 references

Pancyclic graphs. I

0 references

0 references

A sufficient condition for all short cycles

0 references

Weakly pancyclic graphs

0 references

An extremal problem for cycles in hamiltonian graphs

0 references

Some Theorems on Abstract Graphs

0 references

Paths and circuits in graphs: Extreme cases

0 references

The longest cycles in a graph G with minimum degree at least \(| G| /k\)

0 references

On maximal paths and circuits of graphs

0 references

0 references

0 references

On Hamiltonian bipartite graphs

0 references

On a graph theorem by dirac

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

10.1006/jctb.1999.1916

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1569055

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1569055&oldid=34245281"