Results 111 to 120 of about 275 (182)
Discrete Mathematics, 1977 AbstractTwo edges of a graph are said to form a couple when their nodes can be labelled A, B, C, D so that A is adjacent to B but not to C, and D is adjacent to C but not to B. A graph is called matroidal if the binary relation “equals to or forms a couple with” among its edges is an equivalence relation. The structure of matroidal graphs is determined.
openaire +2 more sources
Preface to the Special Topic on Computer Mathematics. [PDF]
J Syst Sci Complex, 2023 Chen S, Mou C.
europepmc +1 more source
Predicting Lifetime and Reliability of Porous Platinum Electrodes in Solid-State Electrolyte Sensors: An Atomic Anharmonic Theory Approach. [PDF]
ACS Omega, 2023 Gao J, Zhao X, Cheng Z, Tian L.
europepmc +1 more source
Algebras, Graphs and Ordered Sets - ALGOS 2020 & the Mathematical Contributions of Maurice Pouzet. [PDF]
Order (Dordr), 2023 Couceiro M, Duffus D.
europepmc +1 more source
Computing the sequence of k-cardinality assignments. [PDF]
J Comb Optim, 2022 Rosenmann A.
europepmc +1 more source
Flip Distances Between Graph Orientations. [PDF]
Algorithmica, 2021 Aichholzer O +6 more
europepmc +1 more source
Non-Preemptive Tree Packing. [PDF]
Algorithmica, 2023 Lendl S, Woeginger G, Wulf L.
europepmc +1 more source
Projective hypersurfaces in tropical scheme theory I: the Macaulay ideal. [PDF]
Res Math SciFink A +3 more
europepmc +1 more source
Constant-competitiveness for random assignment Matroid secretary without knowing the Matroid. [PDF]
Math ProgramSantiago R, Sergeev I, Zenklusen R.
europepmc +1 more source
The cyclic flats of a q-matroid. [PDF]
J Algebr Comb (Dordr)Alfarano GN, Byrne E.
europepmc +1 more source