Results 31 to 40 of about 3,583,809 (318)
A graph rewriting programming language for graph drawing [PDF]
, 1998 This paper describes Grrr, a prototype visual graph drawing tool. Previously there were no visual languages for programming graph drawing algorithms despite the inherently visual nature of the process.
Rodgers, Peter
core +1 more source
Supereulerian Graphs and the Petersen Graph
Journal of Combinatorial Theory, Series B, 1996 A graph \(G\) is called supereulerian if \(G\) has a spanning closed trail. Using a reduction technique, which was developed by the first author [A reduction method to find spanning Eulerian subgraphs, J. Graph Theory 12, No. 1, 29-45 (1988; Zbl 0659.05073)], the authors prove that any 3-edge-connected graph with at most 10 edge cuts of size 3 either ...
Hong-Jian Lai, Paul A. Catlin
openaire +4 more sources
On (a,d)-antimagic labelings of Hn, FLn and mCn
Indonesian Journal of Combinatorics, 2020 In this paper, we derive the necessary condition for an (a,d )- antimagic labeling of some new classes of graphs such as Hn, F Ln and mCn. We prove that Hn is (7n +2, 1)-antimagic and mCn is ((mn+3)/2,1)- antimagic.
Ramalakshmi Rajendran, K. M. Kathiresan
doaj +1 more source
Generation of colored graphs with isomorphism rejection [PDF]
Известия Саратовского университета. Новая серия: Математика. Механика. Информатика, 2021 In the article we consider graphs whose vertices or edges are colored in a given number of colors — vertex and edge colorings. The study of colorings of graphs began in the middle of the 19th century, but the main attention is paid to proper ...
Razumovsky, Peter Vladimirovich +1 more
doaj +1 more source
String graphs and incomparability graphs [PDF]
Proceedings of the twenty-eighth annual symposium on Computational geometry, 2012 Given a collection C of curves in the plane, its string graph is defined as the graph with vertex set C, in which two curves in C are adjacent if and only if they intersect. Given a partially ordered set (P,
Fox, Jacob, Pach, János
openaire +4 more sources
Embedding Graphs into Colored Graphs [PDF]
Transactions of the American Mathematical Society, 1988 If X X is a graph, κ \kappa a cardinal, then there is a graph Y Y such that if the vertex set of Y Y is κ \kappa -colored, then there exists a monocolored induced copy of X X ; moreover, if X X does not contain a complete graph on
Andras Hajnal, Péter Komjáth
openaire +2 more sources
On Rainbow Antimagic Coloring of Joint Product of Graphs
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2023 Let be a connected graph with vertex set and edge set . A bijection from to the set is a labeling of graph . The bijection is called rainbow antimagic vertex labeling if for any two edge and in path , where and .
Brian Juned Septory +3 more
doaj +1 more source
Not All Graphs are Segment T-graphs
European Journal of Combinatorics, 1990 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Noga Alon +2 more
openaire +2 more sources
Embedding Graphs into Embedded Graphs [PDF]
Algorithmica, 2020 A (possibly denerate) drawing of a graph $G$ in the plane is approximable by an embedding if it can be turned into an embedding by an arbitrarily small perturbation. We show that testing, whether a straight-line drawing of a planar graph $G$ in the plane is approximable by an embedding, can be carried out in polynomial time, if a desired embedding of ...
openaire +5 more sources
Streaming Verification of Graph Computations via Graph Structure [PDF]
, 2019 We give new algorithms in the annotated data streaming setting - also known as verifiable data stream computation - for certain graph problems. This setting is meant to model outsourced computation, where a space-bounded verifier limited to sequential ...
Chakrabarti, Amit, Ghosh, Prantar
core +1 more source