Trees through specified vertices (Q1043624)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Trees through specified vertices	scientific article

Statements

scholarly article

0 references

Trees through specified vertices (English)

0 references

zbMATH Open document ID

0 references

10.1016/j.disc.2008.06.032

0 references

Discrete Mathematics

0 references

publication date

9 December 2009

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

subtrees through specified vertices

0 references

Jonathan Cutler

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.disc.2008.06.032

0 references

0 references

The longest cycle of a graph with a large minimal degree

0 references

Cycles through specified vertices

0 references

0 references

Some Theorems on Abstract Graphs

0 references

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

0 references

Note on Hamilton Circuits

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1043624

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