Results 31 to 40 of about 1,716,586 (315)
Line game-perfect graphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceThe $[X,Y]$-edge colouring game is played with a set of $k$ colours on a graph $G$ with initially uncoloured edges by two players, Alice (A) and Bob (B). The players move alternately. Player $X\in\{A,B\}$ has the first move. $Y\in\{A,B,-\}$.
Stephan Dominique Andres, Wai Lam Fong
doaj +1 more source
The Windy Postman Problem on Series-Parallel Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 The windy postman problem is the NP-hard problem of finding the minimum cost of a tour traversing all edges of an undirected graph, where the cost of traversal of an edge depends on the direction. Given an undirected graph $G$, we consider the polyhedron
Francisco Javier Zaragoza Martínez
doaj +1 more source
The first order convergence law fails for random perfect graphs [PDF]
, 2018 We consider first order expressible properties of random perfect graphs. That is, we pick a graph $G_n$ uniformly at random from all (labelled) perfect graphs on $n$ vertices and consider the probability that it satisfies some graph property that can be ...
Bender +10 more
core +2 more sources
Bounding Clique-Width via Perfect Graphs [PDF]
Language and Automata Theory and Applications, 2014 Given two graphs $H_1$ and $H_2$, a graph $G$ is $(H_1,H_2)$-free if it contains no subgraph isomorphic to $H_1$ or $H_2$. We continue a recent study into the clique-width of $(H_1,H_2)$-free graphs and present three new classes of $(H_1,H_2)$-free ...
Konrad Dabrowski +2 more
semanticscholar +1 more source
Discussiones Mathematicae Graph Theory, 2013 Given a graph G = (V,E) and a set Lv of admissible colors for each vertex v ∈ V (termed the list at v), a list coloring of G is a (proper) vertex coloring ϕ : V → S v2V Lv such that ϕ(v) ∈ Lv for all v ∈ V and ϕ(u) 6= ϕ(v) for all uv ∈ E.
Tuza Zsolt
doaj +1 more source
On very strongly perfect Cartesian product graphs
AIMS Mathematics, 2022 Let $ G_1 \square G_2 $ be the Cartesian product of simple, connected and finite graphs $ G_1 $ and $ G_2 $. We give necessary and sufficient conditions for the Cartesian product of graphs to be very strongly perfect.
Ganesh Gandal +2 more
doaj +1 more source
NC Algorithms for Computing a Perfect Matching and a Maximum Flow in One-Crossing-Minor-Free Graphs
, 2020 In 1988, Vazirani gave an NC algorithm for computing the number of perfect matchings in $K_{3,3}$-minor-free graphs by building on Kasteleyn's scheme for planar graphs, and stated that this "opens up the possibility of obtaining an NC algorithm for ...
Eppstein, David, Vazirani, Vijay V.
core +1 more source
The Cost of Perfection for Matchings in Graphs [PDF]
, 2014 Perfect matchings and maximum weight matchings are two fundamental combinatorial structures. We consider the ratio between the maximum weight of a perfect matching and the maximum weight of a general matching.
Brazil, Emilio Vital +3 more
core +1 more source
Perfect State Transfer on Cayley Graphs over Dihedral Groups: The Non-Normal Case
Electronic Journal of Combinatorics, 2020 Recently, perfect state transfer (PST for short) on graphs has attracted great attention due to their applications in quantum information processing and quantum computations.
X. Cao, Bocong Chen, San Ling
semanticscholar +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