Results 91 to 100 of about 8,313 (308)
Inapproximability of Maximum r-Regular Induced Connected Subgraph Problems [PDF]
, 2013 Given a connected graph G = (V,E) on n vertices, the Maximum r-Regular Induced Connected Subgraph (r-MaxRICS) problem asks for a maximum sized subset of vertices S ⊆ V such that the induced subgraph G[S] on S is connected and r-regular.
Miyano, Eiji +4 more
core +2 more sources
A fundamental theorem on graph operators
Mathematics OpenA graph operator is a function [Formula: see text] defined on some set of graphs such that whenever two graphs G and H are isomorphic, written [Formula: see text], then [Formula: see text].
Severino V. Gervacio
doaj +1 more source
Advice Complexity of the Online Induced Subgraph Problem [PDF]
, 2016 Several well-studied graph problems aim to select a largest (or smallest) induced subgraph with a given property of the input graph. Examples include maximum independent set, maximum planar graph, maximum clique, minimum feedback vertex set, and many ...
Královic, Richard +3 more
core +1 more source
Lower Bounds for Maximum Weight Bisections of Weighted Triangle‐Free Subcubic Graphs
Journal of Graph Theory, EarlyView.ABSTRACT A bisection of a graph is a cut in which the number of vertices in the two parts of the cut differ by at most 1. In this paper, we consider maximum weight bisections of edge‐weighted triangle‐free subcubic graphs and show that every weighted triangle‐free subcubic graph G = ( V , E , w ) $G=(V,E,w)$ has a bisection with weight at least θ ⋅ w (
Stefanie Gerke +3 more
wiley +1 more source
Dense subgraphs induced by edge labels [PDF]
, 2023 Iiro Kumpulainen, Nikolaj Tatti
openalex +1 more source
Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems
, 2006 Given a graph G = (V,E) on n vertices, the Maximum r -Regular Induced Subgraph (M- r -RIS) problems ask for a maximum sized subset of vertices R ⊆ V such that the induced subgraph on R, G[R], is r-regular.
Gupta, Sushmita +5 more
core +1 more source
A Coarse Geometric Approach to Graph Layout Problems
Journal of Graph Theory, EarlyView.ABSTRACT We define a range of new coarse geometric invariants based on various graph–theoretic measures of complexity for finite graphs, including treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these invariants can be used to define functions which satisfy a strong monotonicity property, namely, they are ...
Wanying Huang +3 more
wiley +1 more source
A note on the minimum rank of graphs with given dominating induced subgraph
The American Journal of CombinatoricsAn induced subgraph of a graph \(G\) is said to be dominating if every vertex of \(G\) is at distance at most one from this subgraph. We investigate pairs \((G, F)\) where \(F\) is a non-singular dominating induced subgraph of \(G,\) and the rank of \(G\
Zoran Stanić
doaj +1 more source
Orientations of Graphs With at Most One Directed Path Between Every Pair of Vertices
Journal of Graph Theory, EarlyView.ABSTRACT Given a graph G $G$, we say that an orientation D $D$ of G $G$ is a KT orientation if, for all u , v ∈ V ( D ) $u,v\in V(D)$, there is at most one directed path (in any direction) between u $u$ and v $v$. Graphs that admit such orientations have been used to construct graphs with large chromatic number and small clique number that served as ...
Barbora Dohnalová +3 more
wiley +1 more source
A counterexample to a conjecture about triangle-free induced subgraphs of graphs with large chromatic number [PDF]
, 2022 Alvaro Carbonero +3 more
openalex +1 more source