Results 81 to 90 of about 916,150 (184)
The Perfect Graph Conjecture For Toroidal Graphs
, 1984 This chapter discusses the perfect graph conjecture for toroidal graphs. Graphs are assumed to be finite without loops or multiple edges. The ω (G) is defined as the size of the largest complete subgraph of G, while γ (G) is defined as the vertex ...
Grinstead, Charles M., Charles Grinstead
core +1 more source
Joshua H. Perfect Civil War letter
This collection contains a letter written at Helena, Ark., by Joshua Perfect of Company G, 46th Indiana Infantry, to his mother and father at Seafield in White County ...
Perfect, Joshua H., 1843-1864
core +1 more source
Middlebrow Aesthetics: An Explanation and Defense
Pacific Philosophical Quarterly, EarlyView.ABSTRACT We offer a philosophical account of the middlebrow as a theoretical category to do explanatory and critical work in aesthetics. On our account, the middlebrow ought to be understood as aspirational popular art. That is, it is art which aspires both to be popular (in a distinctive sense), and at the same time to be something more than popular ...
Aaron Meskin, Jonathan M. Weinberg
wiley +1 more source
The relationship between intergenerational mobility and equality of opportunity
The Scandinavian Journal of Economics, EarlyView.Abstract Among economists, the analysis of social mobility and the role of parental background is largely carried out in two separate strands of research. The intergenerational mobility literature estimates parent–child persistence in some outcome of interest, such as income.
Adrian Adermon +2 more
wiley +1 more source
The Additive Logic of Epistemic Reasons: An Axiomatic Account
Theoria, EarlyView.ABSTRACT The article argues for a system of axioms that is meant to capture the logic of normative reasons for belief. The system concerns a primitive direct‐reason relation, a defined doxastic‐reason relation, and a primitive function for the revision of rational belief by reasons.
Hannes Leitgeb
wiley +1 more source
A new decomposition theorem for Berge graphs [PDF]
A hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has no odd hole and if its complement has no odd hole. In 2002, Chudnovsky, Robertson, Seymour and Thomas proved a decomposition theorem for Berge graphs saying that ...
Nicolas Trotignon
core
The Journal of Physiology, EarlyView.Abstract figure legend Co‐ingesting fructose with glucose increases exogenous carbohydrate oxidation at sea level, but its effect at altitude is unclear. This study compared glucose–fructose (GLU–FRU), glucose alone (GLU) and placebo during 120 min of running at 70% V̇O2max${{\dot{V}}_{{{{\mathrm{O}}}_2}{\mathrm{max}}}}$ at 2500 m in eight males.
Nicola C. Arjomandkhah +7 more
wiley +1 more source
Maximal outerplanar graphs as chordal graphs, path-neighborhood graphs, and triangle graphs [PDF]
Maximal outerplanar graphs are characterized using three different classes of graphs. A path-neighborhood graph is a connected graph in which every neighborhood induces a path. The triangle graph $T(G)$ has the triangles of the graph $G$ as its vertices,
Novick, B., Laskar, R.C., Mulder, H.M.
core
Vessel arrival planning with full information
International Transactions in Operational Research, Volume 34, Issue 1, Page 372-396, January 2027.Abstract Planning efficiency and timely arrival of vessels is crucial to smooth operations of maritime transport networks, ensuring optimal utilization of resources and minimizing operational costs. Coordination between vessel operators and terminals has the potential to reduce costs, fuel consumption, and waiting time.
Pim Willem Antoon van Leeuwen +1 more
wiley +1 more source
Partitioning a permutation graph: algorithms and an application. [PDF]
In this paper we discuss the problem of partitioning a permutation graph into cliques of bounded size, and describe a real-life application of this problem encountered at a manufacturing company.
Moonen, Linda, Spieksma, Frederik
core