In graph theory, a critical graph is an undirected graph all of whose proper subgraphs have smaller chromatic number. In such a graph, every vertex or...

In graph theory, a mathematical discipline, a factor-critical graph (or hypomatchable graph) is a graph with an odd number of vertices in which deleting...

of edges. A factor-critical graph is a graph with an odd number of vertices, such that for each vertex v, if v is removed from the graph then the remaining...

a k-factor is a factor that is k-regular. In particular, a 1-factor is the same thing as a perfect matching. A factor-critical graph is a graph for which...

generalized compressibility factor graphs based on as many as 25 or more different pure gases, such as the Nelson-Obert graphs. Such graphs are said to have an...

(Mycielski 1955) If G is a factor-critical graph, then so is μ(G) (Došlić 2005). In particular, every graph Mi for i ≥ 2 is factor-critical. If G has a Hamiltonian...

the mathematical field of graph theory, the friendship graph (or Dutch windmill graph or n-fan) Fn is a planar, undirected graph with 2n + 1 vertices and...

vertex is unmatched by some near-perfect matching, then the graph is called factor-critical. Given a matching M, an alternating path is a path that begins...

In graph theory, graph coloring is a methodic assignment of labels traditionally called "colors" to elements of a graph. The assignment is subject to certain...

for every vertex in a graph, there is a near-perfect matching that omits only that vertex, the graph is also called factor-critical. Hall's marriage theorem...

computer science, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects. A graph in this context...

how sparse it is, and is within a constant factor of other sparsity measures such as the arboricity of a graph. Degeneracy is also known as the k-core number...

In statistics, a misleading graph, also known as a distorted graph, is a graph that misrepresents data, constituting a misuse of statistics and with the...

In mathematics, particularly graph theory, and computer science, a directed acyclic graph (DAG) is a directed graph with no directed cycles. That is, it...

mathematician known for her research in graph theory, including work on well-covered graphs, factor-critical graphs, spectral graph theory, Hamiltonian decomposition...

scaling Conformal bootstrap Ising critical exponents Percolation critical exponents Network science Percolation theory Graph theory Hagen Kleinert and Verena...

linear time solution for directed acyclic graphs, which has important applications in finding the critical path in scheduling problems. The NP-hardness...

In physics and engineering, the quality factor or Q factor is a dimensionless parameter that describes how underdamped an oscillator or resonator is. It...

properties: The components of D ( G ) {\displaystyle D(G)} are factor-critical graphs: each component has an odd number of vertices, and when any one...

Self-organized criticality (SOC) is a property of dynamical systems that have a critical point as an attractor. Their macroscopic behavior thus displays...

Critical chain project management (CCPM) is a method of planning and managing projects that emphasizes the resources (people, equipment, physical space)...

graph of the Prothrombin time clot. If a coagulation factor is part of the contact activation or tissue factor pathway, a deficiency of that factor will...

device of covariant perturbation theory, the graphs were called Feynman–Dyson diagrams or Dyson graphs, because the path integral was unfamiliar when...

combinatorics, algebraic, differential, discrete and Euclidean geometries, graph theory, group theory, model theory, number theory, set theory, Ramsey theory...

dimensionless friction factor, known as the Darcy friction factor. This is also variously called the Darcy–Weisbach friction factor, friction factor, resistance...

specifically in graph theory, a polytree (also called directed tree, oriented tree or singly connected network) is a directed acyclic graph whose underlying...

cluster model has a critical limit, described by a conformal field theory. Let G = ( V , E ) {\displaystyle G=(V,E)} be a graph, and ω : E → { 0 , 1...

In chemical graph theory, the Wiener index (also Wiener number) introduced by Harry Wiener, is a topological index of a molecule, defined as the sum of...

Distinguish between the root cause and other causal factors (e.g., via event correlation) Establish a causal graph between the root cause and the problem. RCA...

In materials science, critical resolved shear stress (CRSS) is the shear stress that is necessary to initiate slip on a particular slip system in a grain...