Results 91 to 100 of about 617,805 (269)
Bipartite community affiliation graph.
, 2018 Bipartite community affiliation graph.
Guyu Hu (4042922) +6 more
core +1 more source
Saturated Partial Embeddings of Planar Graphs
Journal of Graph Theory, EarlyView.ABSTRACT In this work, we study how far one can deviate from optimal behavior when embedding a planar graph. For a planar graph G $G$, we say that a plane subgraph H ⊆ G $H\subseteq G$ is a plane‐saturated subgraph if adding any edge (possibly with new vertices) to H $H$ would either violate planarity or make the resulting graph no longer a subgraph of
Alexander Clifton, Nika Salia
wiley +1 more source
Regular embeddings of complete bipartite maps: classification and enumeration
The regular embeddings of complete bipartite graphs Kn, n in orientable surfaces are classified and enumerated, and their automorphism groups and combinatorial properties are determined.
Jones, Gareth
core +1 more source
A Note on Lovász Characterization of Perfect Graphs
Journal of Graph Theory, EarlyView.ABSTRACT A graph is perfect if, for every induced subgraph, the chromatic number equals the size of its largest clique. In 1972, Lovász established a fundamental characterization of perfect graphs, showing that a graph is perfect if and only if, for every induced subgraph, the product of the size of the largest independent set and the size of the ...
James Alex
wiley +1 more source
One-Three Join: A Graph Operation and Its Consequences
Discussiones Mathematicae Graph Theory, 2017 In this paper, we introduce a graph operation, namely one-three join. We show that the graph G admits a one-three join if and only if either G is one of the basic graphs (bipartite, complement of bipartite, split graph) or G admits a constrained ...
Shalu M.A., Devi Yamini S.
doaj +1 more source
Characterization of Graphs Without Even F $F$‐Orientations
Journal of Graph Theory, EarlyView.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
Characterization of Bipartite Graph and its Hamiltonicity [PDF]
, 2008 In this paper, the characterization of bipartite graph will be first described by using the definitions of cycle, Hamiltonian cycle, odd cycle, and chromatic number in a graph. Then, the conditions for a bipartite graph to be Hamiltonian are investigated.
Shwin Seinn
core +1 more source
Structure Guides Function: Beyond Pairwise Neural Interactions. [PDF]
J Comp NeurolSome neurons fire more to synchronous inputs than combination of isolated inputs predicts. This synergistic effect is largely invisible to pairwise measurements. We thus propose to represent neural circuits as hypergraphs, where edges connect three or more interacting neuronal structures, in addition to using lines for connected pairs.
Maier A.
europepmc +2 more sources
Large homogeneous subgraphs in bipartite graphs with forbidden induced subgraphs
, 2021 For a bipartite graph G, let h similar to ( G ) be the largest t such that either G contains K t , t, a complete bipartite subgraph with parts of size t, or the bipartite complement of G contains K t , t as a subgraph.
Lea Weber +2 more
core +1 more source
On the deficiency of bipartite graphs
Discrete Applied Mathematics, 1999 An edge-coloring of a graph \(G\) with colors \(1,2,3,\dots\) is consecutive if the set of colors present at each vertex of \(G\) is a consecutive set of integers. For a bipartite graph \(G\), a consecutive edge-coloring has an application in scheduling and thus had been studied before by A. S. Asratian, R. R. Kamalian, D. Hanson, C. O. M.
Krzysztof Giaro +2 more
openaire +2 more sources