Results 81 to 90 of about 278,889 (179)
Journal of Combinatorial Theory, 1967 AbstractThis expository article describes work which has been done on various problems involving infinite graphs, mentioning also a few unsolved problems or suggestions for future investigation.
openaire +2 more sources
, 2018 We discover new hereditary classes of graphs that are minimal (with respect to set inclusion) of unbounded clique-width. The new examples include split permutation graphs and bichain graphs.
Atminas, A. +3 more
core
Discrete Mathematics, 1978 AbstractWe strengthen a theorem of W.T. Trotter relating α-imperfect graphs to Suslin trees and derive several new results for infinite graphs with no chordless 4-cycles. We show that for such graphs G, (1) if G is χ-perfect then G is α-perfect, and (2) ΘG is at most the first cardinal beyond αG. We also indicate how Martin's axiom can be used to prove
openaire +2 more sources
Discrete Mathematics, 1991 The author gives an introductory survey of the theory of simplicial and related decompositions of graphs. It is based mainly on his recent book ``Graph decompositions. A study in infinite graph theory'' (1990; Zbl 0726.05001). Several open problems are presented.
openaire +1 more source
A Note on Pseudofinite Acyclic Graphs
Известия Иркутского государственного университета: Серия "Математика"Acyclic graphs approximated by finite acyclic graphs are considered. It is proved that any countably categorical acyclic graph is smoothly approximable. An example of pseudofinite acyclic graph theory is given, which has an even, odd, and infinite number
N. D. Markhabatov, Ye. R. Baissalov
doaj +1 more source
Centrosymmetric Graphs And A Lower Bound For Graph Energy Of Fullerenes
Discussiones Mathematicae Graph Theory, 2014 The energy of a molecular graph G is defined as the summation of the absolute values of the eigenvalues of adjacency matrix of a graph G. In this paper, an infinite class of fullerene graphs with 10n vertices, n ≥ 2, is considered.
Katona Gyula Y. +2 more
doaj +1 more source
Reconstructing infinite graphs [PDF]
Pacific Journal of Mathematics, 1974 Bondy, J. A., Hemminger, R. L.
openaire +2 more sources
Inertias of Laplacian matrices of weighted signed graphs
Special Matrices, 2019 We study the sets of inertias achieved by Laplacian matrices of weighted signed graphs. First we characterize signed graphs with a unique Laplacian inertia.
Monfared K. Hassani +3 more
doaj +1 more source
The incidence chromatic number of some graph
International Journal of Mathematics and Mathematical Sciences, 2005 The concept of the incidence chromatic number of a graph was introduced by Brualdi and Massey (1993). They conjectured that every graph G can be incidence colored with Δ(G)+2 colors.
Liu Xikui, Li Yan
doaj +1 more source
Retracts of Infinite Hamming Graphs
Journal of Combinatorial Theory, Series B, 1997 A Hamming graph is a Cartesian product of complete graphs. We show that (finite or infinite) quasi-median graphs, which are a generalization of median graphs, are exactly the retracts of Hamming graphs. This generalizes a result of \textit{H. J. Bandelt} [J.
openaire +2 more sources