The following pages link to Roger Entringer (Q207053):
Displaying 50 items.
- Cycles of length 0 modulo 4 in graphs (Q1309447) (← links)
- A note on the irredundance number after vertex deletion (Q1309448) (← links)
- On the bipartite independence number of a balanced bipartite graph (Q1309450) (← links)
- Computer based proofs by induction in graph theory - A house of cards? (Q1310223) (← links)
- Vulnerability in graphs of diameter four (Q1310232) (← links)
- Edge-integrity: A survey (Q1313818) (← links)
- On the honesty of graph complements (Q1313844) (← links)
- On the edge-integrity of some graphs and their complements (Q1313866) (← links)
- Subdivision thresholds for two classes of graphs (Q1322242) (← links)
- Constructing colorings for diagrams (Q1329806) (← links)
- Independent cycles with limited size in a graph (Q1340129) (← links)
- Toughness and edge-toughness (Q1356703) (← links)
- Independent sets and repeated degrees (Q1363652) (← links)
- Independence and average distance in graphs (Q1363759) (← links)
- Cycle covers of planar 2-edge-connected graphs (Q1376070) (← links)
- Extremal values for ratios of distances in trees (Q1377615) (← links)
- Wiener number of vertex-weighted graphs and a chemical application (Q1377617) (← links)
- Some general aspects of the framing number of a digraph (Q1383372) (← links)
- A survey on Hedetniemi's conjecture (Q1387740) (← links)
- On nonrepetitive sequences (Q1394229) (← links)
- Vertex-neighbor-integrity of magnifiers, expanders, and hypercubes (Q1567283) (← links)
- The Tutte polynomial as a growth function (Q1818371) (← links)
- On kernels in i-triangulated graphs (Q1821791) (← links)
- How often is a polygon bounded by three sides? (Q1837396) (← links)
- Geodetic orientations of complete \(k\)-partite graphs (Q1844242) (← links)
- Line-critical point determining and point distinguishing graphs (Q1846434) (← links)
- Long cycles and 3-connected spanning subgraphs of bounded degree in 3- connected \(K_{1,d}\)-free graphs (Q1892839) (← links)
- Tough Ramsey graphs without short cycles (Q1893953) (← links)
- A short proof of the Chen-Manalastas theorem (Q1903737) (← links)
- Cycle-saturated graphs of minimum size (Q1916094) (← links)
- Chemistry and discrete mathematics (Q1917313) (← links)
- Report on the present state of combinatorics (Q1917532) (← links)
- High girth and extendability (Q1918540) (← links)
- Restrained domination in trees (Q1969775) (← links)
- Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey (Q2277468) (← links)
- Long paths and cycles in tough graphs (Q2366213) (← links)
- On the multiplicative representation of integers (Q2524095) (← links)
- Enumeration of permutations of \((1, \ldots, n)\) by number of maxima (Q2536617) (← links)
- A direct proof of the duality theorem of König (Q2537919) (← links)
- Maximal component-complete subgraphs (Q2546209) (← links)
- Matrices permutable to \(^ *\) matrices (Q2547893) (← links)
- Arc colorings of digraphs (Q2550401) (← links)
- Some properties of components of bigraphs (Q2555855) (← links)
- Sums of valences in bigraphs (Q2560431) (← links)
- Some extremal properties concerning transitivity in graphs (Q2561235) (← links)
- (Q3136984) (← links)
- Class of graphs with restricted neighborhoods (Q3206981) (← links)
- A sufficient condition for equality of edge-connectivity and minimum degree of a graph (Q3206988) (← links)
- (Q3317123) (← links)
- (Q3318802) (← links)
