Results 11 to 20 of about 3,632 (158)
Monadic second-order definable graph orderings [PDF]
Logical Methods in Computer Science, 2014 We study the question of whether, for a given class of finite graphs, one can define, for each graph of the class, a linear ordering in monadic second-order logic, possibly with the help of monadic parameters.
Achim Blumensath, Bruno Courcelle
doaj +1 more source
Chordal Bipartite Graphs with High Boxicity [PDF]
Graphs and Combinatorics, 2011 9 pages, 1 ...
Chandran, Sunil L +2 more
openaire +2 more sources
The Semitotal Domination Problem in Block Graphs
Discussiones Mathematicae Graph Theory, 2022 A set D of vertices in a graph G is a dominating set of G if every vertex outside D is adjacent in G to some vertex in D. A set D of vertices in G is a semitotal dominating set of G if D is a dominating set of G and every vertex in D is within distance 2
Henning Michael A. +2 more
doaj +1 more source
Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs [PDF]
Journal of Combinatorial Optimization, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bonamy, M. +4 more
openaire +3 more sources
Graph classes and forbidden patterns on three vertices [PDF]
, 2020 This paper deals with graph classes characterization and recognition. A popular way to characterize a graph class is to list a minimal set of forbidden induced subgraphs.
Feuilloley, Laurent, Habib, Michel
core +1 more source
On [k] -Roman domination in graphs
AKCE International Journal of Graphs and Combinatorics, 2023 For an integer [Formula: see text] let f be a function that assigns labels from the set [Formula: see text] to the vertices of a simple graph [Formula: see text].
N. Khalili +3 more
doaj +1 more source
The Weisfeiler–Leman Dimension of Chordal Bipartite Graphs Without Bipartite Claw [PDF]
Graphs and Combinatorics, 2021 10 pages, 4 ...
Ilia Ponomarenko, Grigory Ryabov
openaire +2 more sources
Total 2-Rainbow Domination in Graphs
Mathematics, 2022 A total k-rainbow dominating function on a graph G=(V,E) is a function f:V(G)→2{1,2,…,k} such that (i) ∪u∈N(v)f(u)={1,2,…,k} for every vertex v with f(v)=∅, (ii) ∪u∈N(v)f(u)≠∅ for f(v)≠∅.
Huiqin Jiang, Yongsheng Rao
doaj +1 more source
Complexity of Hamiltonian Cycle Reconfiguration
Algorithms, 2018 The Hamiltonian cycle reconfiguration problem asks, given two Hamiltonian cycles C 0 and C t of a graph G, whether there is a sequence of Hamiltonian cycles C 0 , C 1 , … , C t such that C i can be obtained ...
Asahi Takaoka
doaj +1 more source
Total 2-Rainbow Domination Numbers of Trees
Discussiones Mathematicae Graph Theory, 2021 A 2-rainbow dominating function (2RDF) of a graph G = (V (G), E(G)) is a function f from the vertex set V (G) to the set of all subsets of the set {1, 2} such that for every vertex v ∈ V (G) with f(v) = ∅ the condition ∪u∈N(v)f(u) = {1, 2} is fulfilled ...
Ahangar H. Abdollahzadeh +4 more
doaj +1 more source