[图书][B] Graph theory and its applications

JL Gross, J Yellen, M Anderson - 2018 - taylorfrancis.com
Graph Theory and Its Applications, Third Edition is the latest edition of the international,
bestselling textbook for undergraduate courses in graph theory, yet it is expansive enough to …

[图书][B] Digraphs: theory, algorithms and applications

J Bang-Jensen, GZ Gutin - 2008 - books.google.com
The theory of directed graphs has developed enormously over recent decades, yet this book
(first published in 2000) remains the only book to cover more than a small fraction of the …

Advances on the Hamiltonian problem–a survey

RJ Gould - Graphs and Combinatorics, 2003 - Springer
This article is intended as a survey, updating earlier surveys in the area. For completeness
of the presentation of both particular questions and the general area, it also contains …

Updating the Hamiltonian problem—a survey

RJ Gould - Journal of Graph Theory, 1991 - Wiley Online Library
This is intended as a survey article covering recent developments in the area of hamiltonian
graphs, that is, graphs containing a spanning cycle. This article also contains some material …

[Retracted] Topological Attributes of Silicon Carbide SiC4‐IIi, j Based on Ve‐Degree and Ev‐Degree

A Mahboob, D Alrowaili, SM Alam, R Ali… - Journal of …, 2022 - Wiley Online Library
The study of graphs containing edges and nodes is of great importance in science and in
real life. Topological indices (TIs) are numerical parameters linked to chemical graphs used …

Cycles in multipartite tournaments: results and problems

L Volkmann - Discrete mathematics, 2002 - Elsevier
A tournament is an orientation of a complete graph, and in general a multipartite tournament
is an orientation of a complete n-partite graph. Many results about cycles in tournaments are …

Cages—a survey

PK Wong - Journal of Graph Theory, 1982 - Wiley Online Library
Cagesâ•fla survey Page 1 Cages-A Survey Pak-Ken Wong SETON HALL UNIVERSITY SOUTH
ORANGE, NEWJERSEY ABSTRACT We discuss the problem of finding smallest graphs of …

[HTML][HTML] Hamilton decompositions of regular expanders: a proof of Kelly's conjecture for large tournaments

D Kühn, D Osthus - Advances in Mathematics, 2013 - Elsevier
A long-standing conjecture of Kelly states that every regular tournament on n vertices can be
decomposed into (n− 1)/2 edge-disjoint Hamilton cycles. We prove this conjecture for large …

Embedding large subgraphs into dense graphs

D Kühn, D Osthus - arXiv preprint arXiv:0901.3541, 2009 - arxiv.org
What conditions ensure that a graph G contains some given spanning subgraph H? The
most famous examples of results of this kind are probably Dirac's theorem on Hamilton …

Pólya's permanent problem

W McCuaig - the electronic journal of combinatorics, 2004 - combinatorics.org
A square real matrix is sign-nonsingular if it is forced to be nonsingular by its pattern of zero,
negative, and positive entries. We give structural characterizations of sign-nonsingular …