Results 101 to 110 of about 655,680 (212)
Explicit 3‐colorings for Exponential Graphs
ABSTRACT In 1985, El‐Zahar and Sauer showed that the chromatic number of the direct product of two 4‐chromatic graphs is 4, establishing a nontrivial case of Hedetniemi's conjecture, which has since been refuted in general. Their proof uses the concept of an exponential graph, showing that if a graph H $H$ has no proper 3‐coloring, then the exponential
Adrien Argento +2 more
wiley +1 more source
Some structural graph properties of the non-commuting graph of a class of finite Moufang loops
For any non-abelian group G, the non-commuting graph of G, Γ=ΓG, is a graph with vertex set G \ Z(G), where Z(G) is the set of elements of G that commute with every element of G and distinct non-central elements x and y of G are joined by an edge if and ...
Hamideh Hasanzadeh Bashir +1 more
doaj +1 more source
Characterization of Graphs Without Even F $F$‐Orientations
ABSTRACT A graph G $G$ is 1‐extendable if every edge belongs to at least one 1‐factor of G $G$. Let G $G$ be a graph with a 1‐factor F $F$. Then an even (odd) F $F$ ‐orientation of G $G$ is an orientation in which each F $F$‐alternating cycle has exactly an even (odd) number of edges directed in the same fixed direction around the cycle.
Marién Abreu +3 more
wiley +1 more source
On groups with chordal power graph, including a classification in the case of finite simple groups [PDF]
We prove various properties on the structure of groups whose power graph is chordal. Nilpotent groups with this property have been classified by (Electron J Combin 28(3):14, 2021).
Kaja, Eda, Brachter, Jendrik
core +1 more source
ABSTRACT A 2‐edge‐coloured graph G $G$ is called locally complete if for each vertex v $v$, the vertices adjacent to v $v$ through edges of the same colour induce a complete subgraph in G $G$. Locally complete 2‐edge‐coloured graphs have nice properties, and there exists a polynomial algorithm to decide whether such a graph has an alternating ...
Jørgen Bang‐Jensen, Jing Huang
wiley +1 more source
Minimal Elimination Ordering Inside a Given Chordal Graph [PDF]
We consider the following problem, called Relative Minimal Elimination Ordering. Given a graph G=(V,E) which is a subgraph of the chordal graph G'=(V,E'), compute an inclusion minimal chordal graph G''=(V,E''), such that E subseteq E'' subseteq E'.
Dahlhaus, Elias
core +1 more source
Chordal Completions of Planar Graphs
A graph is chordal if there are no induced cycles of length 4 or more. A chordal completion of a graph is formed by adding edges until the resulting graph is chordal. What is the minimal number of edges in a chordal completion? The authors answer this question for the class of planar graphs: every planar graph on \(n\) vertices has a chordal completion
Fan R. K. Chung, David Mumford
openaire +3 more sources
The Minimal Nonplanar Strong Digraphs
ABSTRACT Kuratowski's theorem says that the minimal (under subgraph containment) graphs that are not planar are the subdivisions of K 5 ${K}_{5}$ and of K 3 , 3 ${K}_{3,3}$. Here we study the minimal (under subdigraph containment) strongly‐connected digraphs that are not planar.
Stephen Bartell, Paul Seymour
wiley +1 more source
On the 2-token graph of a graph
Let be a graph and let be a positive integer. Let = and . The -token graph is the graph with vertex set and two vertices and are adjacent if and , where denotes the symmetric difference. In this paper we present several basic results on 2-token graphs.
J. Deepalakshmi +3 more
doaj +1 more source
How Is a Chordal Graph Like a Supersolvable Binary Matroid?
Let G be a finite simple graph. From the pioneering work of R. P. Stanley it is known that the cycle matroid of G is supersolvable i# G is chordal (rigid): this is an other way to read Dirac's theorem on chordal graphs.
Sulamita Klein +2 more
core

