Results 41 to 50 of about 142,988 (312)
04221 Abstracts Collection – Robust and Approximative Algorithms on Particular Graph Classes [PDF]
, 2005 From 23.05.04 to 28.05.04, the Dagstuhl Seminar 04221 ``Robust and Approximative Algorithms on Particular Graph Classes'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl.
Spinrad, Jeremy P. +3 more
core +1 more source
Simpler and Unified Recognition Algorithm for Path Graphs and Directed Path Graphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceA path graph is the intersection graph of paths in a tree. A directed path graph is the intersection graph of paths in a directed tree. Even if path graphs and directed path graphs are characterized very similarly, their recognition algorithms differ ...
Lorenzo Balzotti
doaj +1 more source
Labeling, Covering and Decomposing of Graphs — Smarandache’s Notion in Graph Theory [PDF]
, 2010 This paper surveys the applications of Smarandache’s notion to graph theory appeared in International J.Math.Combin. from Vol.1,2008 to Vol.3,2009.
Mao, Linfan, Linfan Mao
core +1 more source
Tractabilities and Intractabilities on Geometric Intersection Graphs
Algorithms, 2013 A graph is said to be an intersection graph if there is a set of objects such that each vertex corresponds to an object and two vertices are adjacent if and only if the corresponding objects have a nonempty intersection.
Ryuhei Uehara
doaj +1 more source
07211 Abstracts Collection – Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes [PDF]
, 2007 From May 20 to May 25, 2007, the Dagstuhl Seminar 07211 ``Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl.
Spinrad, Jeremy P. +3 more
core +1 more source
Journal of Combinatorial Theory, Series B, 1988 Let be \(G=(V,E)\) be a simple graph and its core B is defined to be the subgraph of G induced by the vertices of maximum degree. In the present paper are given conditions on B which are sufficient for G to be class 1. First is introduced an edge-queue of G which is a sequence of all edges \(e\in E(G)\) with certain properties.
Dean G. Hoffman, Christopher A. Rodger
openaire +1 more source
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
ODD HARMONIOUS LABELING ON SOME STRING GRAPH CLASSES
Barekeng, 2022 A graph with the labeling properties of odd harmonic is called an odd harmonious graph. The purpose of this research was to get labeling properties of odd harmonic on the class of string graphs. The research used was a qualitative research method.
Fery Firmansah
doaj +1 more source
Perfect Roman Domination: Aspects of Enumeration and Parameterization
AlgorithmsPerfect Roman Dominating Functions and Unique Response Roman Dominating Functions are two ways to translate perfect code into the framework of Roman Dominating Functions.
Kevin Mann, Henning Fernau
doaj +1 more source
Substitution-closed pattern classes
, 2011 The substitution closure of a pattern class is the class of all permutations obtained by repeated substitution. The principal pattern classes (those defined by a single restriction) whose substitution closure can be defined by a finite number of ...
Atkinson, M.D. +7 more
core +1 more source