Results 61 to 70 of about 69,865 (208)
Equivalent Formulation of Thomassen's Conjecture Using Tutte Paths in Claw‐Free Graphs
Journal of Graph Theory, EarlyView.ABSTRACT We continue studying Thomassen's conjecture (every 4‐connected line graph has a Hamilton cycle) in the direction of a recently shown equivalence with Jackson's conjecture (every 2‐connected claw‐free graph has a Tutte cycle), and we extend the equivalent formulation as follows: In every connected claw‐free graph, any two vertices are connected
Adam Kabela +2 more
wiley +1 more source
Forbidden subgraphs for supereulerian and hamiltonian graphs
Discrete Applied Mathematics, 2021 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiaojing Yang, Junfeng Du, Liming Xiong
openaire +3 more sources
Two forbidden induced subgraphs and well-quasi-ordering [PDF]
, 2011 It is known that a class of graphs defined by a single forbidden induced subgraph G is well-quasi-ordered by the induced subgraph relation if and only if G is an induced subgraph of P(4).
Nicholas Korpelainen +4 more
core +1 more source
Graphs whose Laplacian eigenvalues are almost all 1 or 2
Special MatricesWe explicitly determine all connected graphs whose Laplacian matrices have at most four eigenvalues different from 1 and 2.
Mohammadian Ali, Xu Shanshan
doaj +1 more source
A Note on Lovász Characterization of Perfect Graphs
Journal of Graph Theory, EarlyView.ABSTRACT A graph is perfect if, for every induced subgraph, the chromatic number equals the size of its largest clique. In 1972, Lovász established a fundamental characterization of perfect graphs, showing that a graph is perfect if and only if, for every induced subgraph, the product of the size of the largest independent set and the size of the ...
James Alex
wiley +1 more source
Frequent Subgraph Mining via Sampling with Rigorous Guarantees [PDF]
, 2022 openFrequent subgraph mining is a fundamental task in the analysis of collections of graphs that aims at finding all the subgraphs that appear with more than a user-specified frequency in the dataset.
PELLIZZONI, PAOLO
core
Heuristic approaches for a new variant of the team orienteering problem
International Transactions in Operational Research, EarlyView.Abstract In this paper, we tackle the team orienteering problem (TOP) with service times, mandatory nodes and incompatibilities arising from two real‐world healthcare applications. We propose two heuristic algorithms: a variable neighbourhood descent algorithm and a matheuristic based on a cut separation approach.
Alberto Guastalla +2 more
wiley +1 more source
Some Variations of Perfect Graphs
Discussiones Mathematicae Graph Theory, 2016 We consider (ψk−γk−1)-perfect graphs, i.e., graphs G for which ψk(H) = γk−1(H) for any induced subgraph H of G, where ψk and γk−1 are the k-path vertex cover number and the distance (k − 1)-domination number, respectively.
Dettlaff Magda +3 more
doaj +1 more source
Lower Bounds for Maximum Weight Bisections of Weighted Triangle‐Free Subcubic Graphs
Journal of Graph Theory, Volume 113, Issue 2, Page 252-273, October 2026.ABSTRACT A bisection of a graph is a cut in which the number of vertices in the two parts of the cut differ by at most 1. In this paper, we consider maximum weight bisections of edge‐weighted triangle‐free subcubic graphs and show that every weighted triangle‐free subcubic graph G = ( V , E , w )
wiley +1 more source
Forbidden Subgraphs and Complete Partitions
The Electronic Journal of CombinatoricsA graph is called an $(r,k)$-graph if its vertex set can be partitioned into $r$ parts, each having at most $k$ vertices and there is at least one edge between any two parts. Let $f(r,H)$ be the minimum $k$ for which there exists an $H$-free $(r,k)$-graph.
John Byrne, Michael Tait, Craig Timmons
openaire +3 more sources