The following pages link to Matemática Contemporânea (Q6489427):
Displaying 50 items.
- Some novelties on intersecting families of subsets (Q6492316) (← links)
- On the sum of the angles of orthogonal polyhedra, and guarding orthogonal polyhedra (Q6492317) (← links)
- \(t\)-pebbling in \(k\)-connected graphs with a universal vertex (Q6492318) (← links)
- A linear algorithm for the distance in Cayley graph \(H_{\ell,p}\) (Q6492319) (← links)
- \textsc{Tessellability} and \textsc{tessellability completion} of graphs with few \(P_4\) (Q6492322) (← links)
- Equitable total chromatic number of infinite classes of complete tripartite non balanced graphs (Q6492323) (← links)
- Critical ideals and applications (Q6492324) (← links)
- Complementary prisms with 2-assignment of roles (Q6492325) (← links)
- Decomposition of graphs into trees with bounded maximum degree (Q6492326) (← links)
- Size multipartite Ramsey numbers for bipartite graphs (Q6492327) (← links)
- Colorings, cliques and relaxations of planarity (Q6492328) (← links)
- Covering a body using unequal spheres and the problem of finding covering holes (Q6492329) (← links)
- On the Helly number in the \(P_3\) and related convexities for \((q,q-4)\) graphs (Q6492330) (← links)
- A note on the maximum weight planar subgraph problem (Q6492332) (← links)
- A connectivity-based decomposition for graph edge-colouring (Q6492333) (← links)
- Proper gap-labellings of unicyclic graphs (Q6492335) (← links)
- An optimal algorithm to totally color some powers of cycle graphs (Q6492336) (← links)
- Simulating digital circuits with clique graphs (Q6492338) (← links)
- Meyniel's conjecture on graphs with few P4's (Q6492339) (← links)
- The unit-demand envy-free pricing problem applied to the sports entertainment industry (Q6492341) (← links)
- Notes on models for distance coloring problems (Q6492343) (← links)
- Interval number \(P_3\) of prisms complementary of acyclic graphs (Q6492345) (← links)
- A study of networks with arc-disjoint branched flows (Q6492346) (← links)
- Algorithms and limits for some cases. Polynomials of oriented colouring (Q6492347) (← links)
- Aspects of the complexity of \((\gamma,\mu)\)-coloring (Q6492348) (← links)
- On the diameter of spherical fullerene graphs (Q6492350) (← links)
- Brill-Noether problems, Ulrich bundles and the cohomology of moduli spaces of sheaves (Q6496777) (← links)
- A family of vector bundles on \(\mathbb{P}^3\) of homological dimension 2 and \(\chi(\operatorname{End}E)=1\) (Q6496778) (← links)
- Enumeration of hypersurfaces with prescribed non-isolated singular subschemes (Q6496779) (← links)
- Geography and geometry of the moduli spaces of semi-stable rank 2 sheaves on projective space (Q6496780) (← links)
- Célia Mello: academic contribution to the training of human resources (Q6496784) (← links)
- On PVPG graphs: a subclass of vertex intersection graphs of paths on a grid (Q6496785) (← links)
- A note on Helly-\(B_1\)-EPG graphs (Q6496786) (← links)
- \(k\)-tuple and \(k\)-tuple total dominations on web graphs (Q6496787) (← links)
- Exact algorithms for biclique coloring (Q6496788) (← links)
- Independent sets in corona graphs (Q6496789) (← links)
- Range-relaxed graceful game on graphs (Q6496790) (← links)
- Subclass hierarchy on circular arc bigraphs (Q6496793) (← links)
- On 4-regular square-complementary graphs of large girth (Q6496795) (← links)
- Total coloring in some split-comparability graphs (Q6496796) (← links)
- On total coloring of a superposition snark family (Q6496797) (← links)
- Equitable partition of graphs into independent sets and cliques (Q6496798) (← links)
- Hunting a type 2 fullerene nanodisc (Q6496801) (← links)
- The strict terminal connection problem on chordal bipartite graphs (Q6496802) (← links)
- Transversals in hypergraphs through a new combinatorial game (Q6496803) (← links)
- Network science: a primer (Q6496804) (← links)
- On dihedral flows of generalized Petersen graphs cellularly embedded in closed orientable surfaces (Q6496806) (← links)
- A tribute to Célia P. de Mello (Q6496807) (← links)
- About tree immersion in grids (Q6496809) (← links)
- \(k\)-independence on complementary prism graphs (Q6496811) (← links)
