Results 21 to 30 of about 10,088 (246)
A pair of forbidden subgraphs and perfect matchings
Journal of Combinatorial Theory, Series B, 2005 AbstractIn this paper, we study the relationship between forbidden subgraphs and the existence of a matching. Let H be a set of connected graphs, each of which has three or more vertices. A graph G is said to be H-free if no graph in H is an induced subgraph of G.
Shinya Fujita +5 more
openalex +3 more sources
Forbidden subgraph decomposition
Discrete Mathematics, 2002 no ...
Rusu, Irena, Spinrad, Jeremy P.
openaire +3 more sources
Graphs with forbidden subgraphs
Journal of Combinatorial Theory, Series B, 1971 AbstractMany graphs which are encountered in the study of graph theory are characterized by a type of configuration or subgraph they possess. However, there are occasions when such graphs are more easily defined or described by the kind of subgraphs they are not permitted to contain.
Gary Chartrand +2 more
openaire +3 more sources
Coloring Graphs Characterized by a Forbidden Subgraph [PDF]
Discrete Applied Mathematics, 2012 The Coloring problem is to test whether a given graph can be colored with at most k colors for some given k, such that no two adjacent vertices receive the same color. The complexity of this problem on graphs that do not contain some graph H as an induced subgraph is known for each fixed graph H.
Golovach, P.A., Paulusma, D., Ries, B.
openaire +7 more sources
Classes of graphs with restricted interval models [PDF]
Discrete Mathematics & Theoretical Computer Science, 1999 We introduce q-proper interval graphs as interval graphs with interval models in which no interval is properly contained in more than q other intervals, and also provide a forbidden induced subgraph characterization of this class of graphs.
Andrzej Proskurowski, Jan Arne Telle
doaj +2 more sources
On Minrank and Forbidden Subgraphs [PDF]
ACM Transactions on Computation Theory, 2019 The minrank over a field F of a graph G on the vertex set { 1,2,… , n } is the minimum possible rank of a matrix M ∈ F n × n such that M
openaire +5 more sources
Forbidden subgraph pairs for traceability of block-chains
Electronic Journal of Graph Theory and Applications, 2013 A block-chain is a graph whose block graph is a path, i.e. it is either a $P_1$, a $P_2$, or a 2-connected graph, or a graph of connectivity 1 with exactly two end-blocks. A graph is called traceable if it contains a Hamilton path.
Binlong Li +2 more
doaj +1 more source
Intersection Dimension and Graph Invariants
Discussiones Mathematicae Graph Theory, 2021 We show that the intersection dimension of graphs with respect to several hereditary properties can be bounded as a function of the maximum degree. As an interesting special case, we show that the circular dimension of a graph with maximum degree Δ is at
Aravind N.R., Subramanian C.R.
doaj +1 more source
On hamiltonicity of 1-tough triangle-free graphs
Electronic Journal of Graph Theory and Applications, 2021 Let ω(G) denote the number of components of a graph G. A connected graph G is said to be 1-tough if ω(G − X)≤|X| for all X ⊆ V(G) with ω(G − X)>1. It is well-known that every hamiltonian graph is 1-tough, but that the reverse statement is not true in ...
Wei Zheng, Hajo Broersma, Ligong Wang
doaj +1 more source
The graph grabbing game on {0,1}-weighted graphs
Results in Applied Mathematics, 2019 The graph grabbing game is a two-player game on a weighted connected graph in which two players, Alice and Bob, alternatively remove non-cut vertices one by one to gain the weights on them.
Soogang Eoh, Jihoon Choi
doaj +1 more source