Name
Abstract | ||
|---|---|---|
Let k=3 be an integer. Denote by T\"k the following statement: If a graph G is a non-star graph without cycles of length = |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1016/j.disc.2003.11.048 | Discrete Mathematics |
Keywords | Field | DocType |
cycles,embedding without fixed points,embedding of graphs,star graph,fixed point | Discrete mathematics,Combinatorics,Graph toughness,Line graph,Vertex-transitive graph,Regular graph,Symmetric graph,Pancyclic graph,Mathematics,Voltage graph,Complement graph | Journal |
Volume | Issue | ISSN |
286 | 1-2 | Discrete Mathematics |
Citations | PageRank | References |
2 | 0.61 | 2 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Agnieszka Görlich | 1 | 27 | 9.19 |
| Monika Pilśniak | 2 | 28 | 9.31 |
| Mariusz Woźniak | 3 | 204 | 34.54 |
| Irmina A. Zioło | 4 | 16 | 3.98 |