Results 81 to 90 of about 584,165 (157)

Vertex Colorings without Rainbow Subgraphs

Discussiones Mathematicae Graph Theory, 2016
Given a coloring of the vertices of a graph G, we say a subgraph is rainbow if its vertices receive distinct colors. For a graph F, we define the F-upper chromatic number of G as the maximum number of colors that can be used to color the vertices of G ...
Goddard Wayne, Xu Honghai
doaj   +1 more source

Parallel O(log(n)) time edge-colouring of trees and Halin graphs [PDF]

We present parallel O(log(n))-time algorithms for optimal edge colouring of trees and Halin graphs with n processors on a a parallel random access machine without write conflicts (P-RAM).
Gibbons, Alan (Alan M.), Israeli, Amos, Rytter, Wojciech   +2 more
core  

Rook-drawings of Plane Graphs

Journal of Graph Algorithms and Applications, 2017
We introduce a new type of graph drawing called "rook-drawing". A rook-drawing of a graph $G$ is obtained by placing the $n$ nodes of $G$ on the intersections of a regular grid, such that each row and column of the grid supports exactly one node.
David Auber, Nicolas Bonichon, Paul Dorbec, Claire Pennarun   +3 more
doaj   +1 more source

A Survey of Maximal k-Degenerate Graphs and k-Trees

Theory and Applications of Graphs
This article surveys results on maximal $k$-degenerate graphs, $k$-trees, and related classes including simple $k$-trees, $k$-paths, maximal outerplanar graphs, and Apollonian networks.
Allan Bickle
doaj   +1 more source

The subgraph isomorphism problem for outerplanar graphs [PDF]

, 1982
This paper deals with the subgraph isomorphism problem for outerplanar graphs (SUBOUTISOM). In general, since trees and forests are outerplanar, SUBOUTISOM is NP-complete.
SysŁ;o, Maciej M.
core   +1 more source

Minimum rank of outerplanar graphs [PDF]

, 2012
The problem of finding the minimum rank over all symmetric matrices corresponding to a given graph has grown in interest recently. It is well known that the minimum rank of any graph is bounded above by the clique cover number, the minimum number of ...
John Sinkovic, Sinkovic, John, Kempton, Mark, Mark Kempton   +3 more
core   +1 more source

A graph and its complement with specified properties I: connectivity

International Journal of Mathematics and Mathematical Sciences, 1979
We investigate the conditions under which both a graph G and its complement G¯ possess a specified property. In particular, we characterize all graphs G for which G and G¯ both (a) have connectivity one, (b) have line-connectivity one, (c) are 2 ...
Jin Akiyama, Frank Harary
doaj   +1 more source

The Tutte polynomial characterizes simple outerplanar graphs [PDF]

, 2011
We show that if G is a simple outerplanar graph and H is a graph with the same Tutte polynomial as G, then H is also outerplanar.
Noy, M., de Mier, A, Noble, Steven, M. NOY, Andrew J. Goodall, Noble, S., Noy, M, Mier Vinué, Anna de, A. J. GOODALL, Noble, SD, Goodall, A.J., A. de MIER, de Mier, A., Goodall, AJ, S. D. NOBLE, Anna de Mier, Goodall, Andrew, Noy Serrano, Marcos, Steven D. Noble, Marc Noy   +19 more
core   +2 more sources

Special Issue Dedicated to the 16th International Symposium on Parameterized and Exact Computation. [PDF]

Algorithmica, 2022
Golovach PA, Zehavi M.
europepmc   +1 more source

Crosscap of the non-cyclic graph of groups

AKCE International Journal of Graphs and Combinatorics, 2016
The non-cyclic graph CG to a non locally cyclic group G is as follows: take G∖Cyc(G) as vertex set, where Cyc(G)={x∈G|〈x,y〉  is cyclic for all  y∈G} is called the cyclicizer of G, and join two vertices if they do not generate a cyclic subgroup.
K. Selvakumar, M. Subajini
doaj   +1 more source