Results 71 to 80 of about 5,057 (262)
InfoScience, EarlyView.Designing new polymers for applications such as sustainable plastics, biomaterials, and 3D printing has traditionally been slow and expensive, relying heavily on trial‐and‐error experiments. This review shows how polymer informatics—the integration of large polymer databases, machine‐learning models, and automated robotic synthesis—enables fast ...
Md. Saiful Islam +6 more
wiley +1 more source
Efficient enumeration of maximal k-degenerate induced subgraphs of a chordal graph [PDF]
, 2018 In this paper we consider the problem of listing the maximal k-degenerate induced subgraphs of a chordal graph, and propose an output-sensitive algorithm using delay O(m⋅ω(G)) for any n-vertex chordal graph with m edges, where ω(G)≤n is the maximum size ...
Otachi Y. +4 more
core +2 more sources
Matching book thickness of generalized Petersen graphs
Electronic Journal of Graph Theory and Applications, 2022 The matching book embedding of a graph G is to place its vertices on the spine, and arrange its edges on the pages so that the edges in the same page do not intersect each other and the edges induced subgraphs of each page are 1-regular.
Zeling Shao, Huiru Geng, Zhiguo Li
doaj +1 more source
Well quasi-order in combinatorics : embeddings and homomorphisms
, 2015 The notion of well quasi-order (wqo) from the theory of ordered sets often arises naturally in contexts where one deals with infinite collections of structures which can somehow be compared, and it then represents a useful discriminator between ‘tame ...
Ruskuc, Nik +3 more
core +1 more source
On regular induced subgraphs of edge-regular graphs. [PDF]
, 2020 PhD Thesis.We study edge-regular graphs and their regular induced subgraphs. More precisely, we are interested in vertex partitions of edge-regular graphs into two parts, for which one or both of the parts induce a regular subgraph.
Evans, Rhys J.
core
Induced subgraphs and tree decompositions V. one neighbor in a hole
, 2022 What are the unavoidable induced subgraphs of graphs with large treewidth? It is well-known that the answer must include a complete graph, a complete bipartite graph, all subdivisions of a wall and line graphs of all subdivisions of a wall (we refer to ...
Abrishami, T. +5 more
core +2 more sources
Signed Projective Cubes, a Homomorphism Point of View
Journal of Graph Theory, EarlyView.ABSTRACT The (signed) projective cubes, as a special class of graphs closely related to the hypercubes, are on the crossroad of geometry, algebra, discrete mathematics and linear algebra. Defined as Cayley graphs on binary groups, they represent basic linear dependencies.
Meirun Chen +2 more
wiley +1 more source
Cuts and Induced Bipartite Subgraphs
, 2017 In this chapter we compare three popular models for the maximum cut problem and show the equivalence of their relaxations by using compact extended formulations. These problems are closely related to the subject of edge-induced and node-induced bipartite
Lancia G. +3 more
core +1 more source
Fractional Balanced Chromatic Number and Arboricity of Planar (Signed) Graphs
Journal of Graph Theory, EarlyView.ABSTRACT A balanced ( p , q ) $(p,q)$‐coloring of a signed graph ( G , σ ) $(G,\sigma )$ is an assignment of q $q$ colors to each vertex of G $G$ from a platter of p $p$ colors, such that each color class induces a balanced set (a set that does not induce a negative cycle).
Reza Naserasr +3 more
wiley +1 more source
On the validity of Lovász’s inequality for induced star-perfect graphs
Journal of Inequalities and ApplicationsLet F $\mathcal{F}$ be a family of graphs. For a graph G, define θ F ( G ) $\theta _{F}(G)$ as the minimum number of induced subgraphs of G, each isomorphic to a member of F $\mathcal{F}$ , needed to cover V ( G ) $V(G)$ , and α F ( G ) $\alpha _{F}(G ...
James Alex, Louis Caccetta
doaj +1 more source